[PATCH] <short summary of the patch>
authorCamm Maguire <camm@debian.org>
Wed, 13 May 2026 17:27:35 +0000 (17:27 +0000)
committerCamm Maguire <camm@debian.org>
Sat, 16 May 2026 12:55:17 +0000 (08:55 -0400)
TODO: Put a short summary on the line above and replace this paragraph
with a longer explanation of this change. Complete the meta-information
with other relevant fields (see below for details). To make it easier, the
information below has been extracted from the changelog. Adjust it or drop
it.

Bug-Debian: https://bugs.debian.org/1105309

Gbp-Pq: Name Version_2_7_2pre20

16 files changed:
git.tag
info/c-interface.texi
info/gcl-dwdoc.info
info/gcl-si.info
info/gcl-si.info-1
info/gcl.info
info/gcl.info-1
info/gcl.info-2
info/gcl.info-3
info/gcl.info-4
info/gcl.info-5
info/gcl.info-6
info/gcl.info-7
info/gcl.info-8
info/gcl.info-9
info/system.texi

diff --git a/git.tag b/git.tag
index f74717b69d05393321bb4234e6dd0c60b2ffd4e4..5c5e48120acb70eeb537f17c42065c7934bc47be 100644 (file)
--- a/git.tag
+++ b/git.tag
@@ -1 +1 @@
-"Version_2_7_2pre19"
+"Version_2_7_2pre20"
index b2c108140280c5d5a4810f092ac879b4dd523f95..2ba396e3c102a24a35cccd39f9fcc092b8ba0e5b 100755 (executable)
@@ -8,7 +8,7 @@
 * External Shared Libraries::
 @end menu
 
-@node Available Symbols,  , C Interface, C Interface
+@node Available Symbols, External Shared Libraries , C Interface, C Interface
 @section Available Symbols
 
 When GCL is built, those symbols in the system libraries which
index 3eee0eccd68231f3670fbd3301da394ba1409585..105d0d7af7eede6fa42afbc64e6dbe597eb16b5e 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl-dwdoc.info, produced by makeinfo version 7.1 from
+This is gcl-dwdoc.info, produced by makeinfo version 7.3 from
 gcl-dwdoc.texi.
 
 This is a Texinfo GCL DWDOC Manual
@@ -882,7 +882,6 @@ that were adapted from X Consortium software:
 
 ;;*****************************************************************
 
-
 \1f
 Tag Table:
 Node: Top\7f415
index b0a137586b112fad3f8004e33804f5c68835222a..d94ea587296e2dd10bfdeb2358c2447d064fa335 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl-si.info, produced by makeinfo version 7.2 from gcl-si.texi.
+This is gcl-si.info, produced by makeinfo version 7.3 from gcl-si.texi.
 
 This is a Texinfo GCL SYSTEM INTERNALS Manual
 
@@ -12,46 +12,46 @@ END-INFO-DIR-ENTRY
 \1f
 Indirect:
 gcl-si.info-1: 319
-gcl-si.info-2: 343510
+gcl-si.info-2: 343457
 \1f
 Tag Table:
 (Indirect)
 Node: Top\7f319
-Node: Numbers\7f1239
-Node: Sequences and Arrays and Hash Tables\7f23635
-Node: Characters\7f49430
-Node: Lists\7f56802
-Node: Streams and Reading\7f70576
-Node: Special Forms and Functions\7f95964
-Node: Compilation\7f121601
-Node: Symbols\7f133502
-Node: Operating System\7f143262
-Node: Command Line\7f143478
-Node: Operating System Definitions\7f147660
-Node: Environment Variables\7f154017
-Node: Structures\7f155607
-Node: Iteration and Tests\7f157159
-Node: User Interface\7f160609
-Node: Doc\7f169668
-Node: Type\7f172953
-Node: GCL Specific\7f175611
-Node: Bignums\7f184163
-Node: C Interface\7f186852
-Node: Available Symbols\7f187044
-Node: External Shared Libraries\7f187535
-Node: System Definitions\7f203120
-Node: Regular Expressions\7f235093
-Node: Debugging\7f241340
-Node: Source Level Debugging in Emacs\7f241541
-Node: Low Level Debug Functions\7f245786
-Node: Miscellaneous\7f246786
-Node: Environment\7f246994
-Node: Inititialization\7f247619
-Node: Low Level X Interface\7f248163
-Node: Compiler Definitions\7f248760
-Node: JAPI GUI Library Binding\7f254730
-Node: Function Index\7f273784
-Node: Variable Index\7f343510
+Node: Numbers\7f1205
+Node: Sequences and Arrays and Hash Tables\7f23601
+Node: Characters\7f49396
+Node: Lists\7f56768
+Node: Streams and Reading\7f70542
+Node: Special Forms and Functions\7f95930
+Node: Compilation\7f121567
+Node: Symbols\7f133468
+Node: Operating System\7f143228
+Node: Command Line\7f143444
+Node: Operating System Definitions\7f147626
+Node: Environment Variables\7f153983
+Node: Structures\7f155548
+Node: Iteration and Tests\7f157100
+Node: User Interface\7f160550
+Node: Doc\7f169609
+Node: Type\7f172894
+Node: GCL Specific\7f175552
+Node: Bignums\7f184104
+Node: C Interface\7f186793
+Node: Available Symbols\7f186985
+Node: External Shared Libraries\7f187476
+Node: System Definitions\7f203067
+Node: Regular Expressions\7f235040
+Node: Debugging\7f241287
+Node: Source Level Debugging in Emacs\7f241488
+Node: Low Level Debug Functions\7f245733
+Node: Miscellaneous\7f246733
+Node: Environment\7f246941
+Node: Inititialization\7f247566
+Node: Low Level X Interface\7f248110
+Node: Compiler Definitions\7f248707
+Node: JAPI GUI Library Binding\7f254677
+Node: Function Index\7f273731
+Node: Variable Index\7f343457
 \1f
 End Tag Table
 
index 094f7223eca0cc864bf169928063f9d829fe96f5..7eeed39a8031f39e0c7a314c4bdfffd6983f6547 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl-si.info, produced by makeinfo version 7.2 from gcl-si.texi.
+This is gcl-si.info, produced by makeinfo version 7.3 from gcl-si.texi.
 
 This is a Texinfo GCL SYSTEM INTERNALS Manual
 
@@ -10,10 +10,10 @@ START-INFO-DIR-ENTRY
 END-INFO-DIR-ENTRY
 
 \1f
-File: gcl-si.info,  Node: Top,  Next: Numbers,  Prev: (dir),  Up: (dir)
+File: gcl-si.info,  Node: Top,  Next: Numbers,  Up: (dir)
 
-GCL SI Manual
-*************
+Top
+***
 
 * Menu:
 
@@ -4900,7 +4900,7 @@ File: gcl-si.info,  Node: Operating System Definitions,  Prev: Command Line,  Up
      may be any non-negative, non-complex number.
 
 \1f
-File: gcl-si.info,  Node: Environment Variables,  Next: Operating System Definitions,  Prev: Operating System,  Up: Operating System
+File: gcl-si.info,  Node: Environment Variables,  Prev: Operating System Definitions,  Up: Operating System
 
 9.3 Environment Variables
 =========================
@@ -5846,7 +5846,7 @@ which reference other libraries, but in general this practice is not
 portable.
 
 \1f
-File: gcl-si.info,  Node: External Shared Libraries,  Prev: C Interface,  Up: C Interface
+File: gcl-si.info,  Node: External Shared Libraries,  Prev: Available Symbols,  Up: C Interface
 
 16.2 External Shared Libraries
 ==============================
index b3751b260b283fba222c1b0abe1aedc4deee6379..ffa1c65b52555ed53441482b7f81778f0ead8a68 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -13,1456 +13,1456 @@ END-INFO-DIR-ENTRY
 \1f
 Indirect:
 gcl.info-1: 314
-gcl.info-2: 300673
-gcl.info-3: 600586
-gcl.info-4: 904020
-gcl.info-5: 1201894
-gcl.info-6: 1501104
-gcl.info-7: 1802018
-gcl.info-8: 2102858
-gcl.info-9: 2400458
+gcl.info-2: 300631
+gcl.info-3: 600484
+gcl.info-4: 903907
+gcl.info-5: 1201764
+gcl.info-6: 1500948
+gcl.info-7: 1801845
+gcl.info-8: 2102668
+gcl.info-9: 2400395
 \1f
 Tag Table:
 (Indirect)
 Node: Top\7f314
-Node: Introduction (Introduction)\7f41180
-Node: Scope\7f41532
-Node: Scope and Purpose\7f41780
-Node: History\7f42223
-Node: Organization of the Document\7f51794
-Node: Referenced Publications\7f54049
-Node: Definitions\7f57706
-Node: Notational Conventions\7f58098
-Node: Font Key\7f58727
-Node: Modified BNF Syntax\7f60568
-Node: Splicing in Modified BNF Syntax\7f60943
-Node: Indirection in Modified BNF Syntax\7f63439
-Node: Additional Uses for Indirect Definitions in Modified BNF Syntax\7f64087
-Node: Special Symbols\7f65271
-Node: Objects with Multiple Notations\7f70068
-Node: Case in Symbols\7f70512
-Node: Numbers (Objects with Multiple Notations)\7f71682
-Node: Use of the Dot Character\7f72082
-Node: NIL\7f73024
-Node: Designators\7f75082
-Node: Nonsense Words\7f77493
-Node: Error Terminology\7f78172
-Node: Sections Not Formally Part Of This Standard\7f85495
-Node: Interpreting Dictionary Entries\7f87005
-Node: The "Affected By" Section of a Dictionary Entry\7f89404
-Node: The "Arguments" Section of a Dictionary Entry\7f89937
-Node: The "Arguments and Values" Section of a Dictionary Entry\7f90459
-Node: The "Binding Types Affected" Section of a Dictionary Entry\7f91222
-Node: The "Class Precedence List" Section of a Dictionary Entry\7f91910
-Node: Dictionary Entries for Type Specifiers\7f93086
-Node: The "Compound Type Specifier Kind" Section of a Dictionary Entry\7f94228
-Node: The "Compound Type Specifier Syntax" Section of a Dictionary Entry\7f95279
-Node: The "Compound Type Specifier Arguments" Section of a Dictionary Entry\7f95955
-Node: The "Compound Type Specifier Description" Section of a Dictionary Entry\7f96522
-Node: The "Constant Value" Section of a Dictionary Entry\7f97073
-Node: The "Description" Section of a Dictionary Entry\7f97527
-Node: The "Examples" Section of a Dictionary Entry\7f98052
-Node: The "Exceptional Situations" Section of a Dictionary Entry\7f98541
-Node: The "Initial Value" Section of a Dictionary Entry\7f99382
-Node: The "Argument Precedence Order" Section of a Dictionary Entry\7f99906
-Node: The "Method Signature" Section of a Dictionary Entry\7f100434
-Node: The "Name" Section of a Dictionary Entry\7f101970
-Node: The "Notes" Section of a Dictionary Entry\7f104030
-Node: The "Pronunciation" Section of a Dictionary Entry\7f104740
-Node: The "See Also" Section of a Dictionary Entry\7f105555
-Node: The "Side Effects" Section of a Dictionary Entry\7f106030
-Node: The "Supertypes" Section of a Dictionary Entry\7f106462
-Node: The "Syntax" Section of a Dictionary Entry\7f107099
-Node: Special "Syntax" Notations for Overloaded Operators\7f108288
-Node: Naming Conventions for Rest Parameters\7f109441
-Node: Requiring Non-Null Rest Parameters in The "Syntax" Section\7f110300
-Node: Return values in The "Syntax" Section\7f111200
-Node: No Arguments or Values in The "Syntax" Section\7f111890
-Node: Unconditional Transfer of Control in The "Syntax" Section\7f112491
-Node: The "Valid Context" Section of a Dictionary Entry\7f113061
-Node: The "Value Type" Section of a Dictionary Entry\7f113702
-Node: Conformance\7f114057
-Node: Conforming Implementations\7f114473
-Node: Required Language Features\7f115078
-Node: Documentation of Implementation-Dependent Features\7f115707
-Node: Documentation of Extensions\7f116434
-Node: Treatment of Exceptional Situations\7f117077
-Node: Resolution of Apparent Conflicts in Exceptional Situations\7f117476
-Node: Examples of Resolution of Apparent Conflict in Exceptional Situations\7f118146
-Node: Conformance Statement\7f119150
-Node: Conforming Programs\7f120133
-Node: Use of Implementation-Defined Language Features\7f121094
-Node: Use of Read-Time Conditionals\7f122310
-Node: Language Extensions\7f123461
-Node: Language Subsets\7f125874
-Node: Deprecated Language Features\7f126591
-Node: Deprecated Functions\7f127432
-Node: Deprecated Argument Conventions\7f127991
-Node: Deprecated Variables\7f129001
-Node: Deprecated Reader Syntax\7f129250
-Node: Symbols in the COMMON-LISP Package\7f129721
-Node: Syntax\7f152233
-Node: Character Syntax\7f152477
-Node: Readtables\7f153230
-Node: The Current Readtable\7f154064
-Node: The Standard Readtable\7f154649
-Node: The Initial Readtable\7f155186
-Node: Variables that affect the Lisp Reader\7f155641
-Node: Standard Characters\7f156195
-Node: Character Syntax Types\7f160645
-Node: Constituent Characters\7f164581
-Node: Constituent Traits\7f165196
-Node: Invalid Characters\7f168740
-Node: Macro Characters\7f169288
-Node: Multiple Escape Characters\7f172062
-Node: Examples of Multiple Escape Characters\7f172717
-Node: Single Escape Character\7f173222
-Node: Examples of Single Escape Characters\7f173717
-Node: Whitespace Characters\7f174211
-Node: Examples of Whitespace Characters\7f174560
-Node: Reader Algorithm\7f174926
-Node: Interpretation of Tokens\7f181432
-Node: Numbers as Tokens\7f181792
-Node: Potential Numbers as Tokens\7f182896
-Node: Escape Characters and Potential Numbers\7f185486
-Node: Examples of Potential Numbers\7f186251
-Node: Constructing Numbers from Tokens\7f187377
-Node: Syntax of a Rational\7f188178
-Node: Syntax of an Integer\7f188393
-Node: Syntax of a Ratio\7f188984
-Node: Syntax of a Float\7f190114
-Node: Syntax of a Complex\7f192612
-Node: The Consing Dot\7f193668
-Node: Symbols as Tokens\7f194192
-Node: Valid Patterns for Tokens\7f197687
-Node: Package System Consistency Rules\7f201027
-Node: Standard Macro Characters\7f202688
-Node: Left-Parenthesis\7f203460
-Node: Right-Parenthesis\7f204990
-Node: Single-Quote\7f205317
-Node: Examples of Single-Quote\7f205775
-Node: Semicolon\7f206012
-Node: Examples of Semicolon\7f206576
-Node: Notes about Style for Semicolon\7f206803
-Node: Use of Single Semicolon\7f207220
-Node: Use of Double Semicolon\7f207811
-Node: Use of Triple Semicolon\7f208309
-Node: Use of Quadruple Semicolon\7f208689
-Node: Examples of Style for Semicolon\7f209199
-Node: Double-Quote\7f210172
-Node: Backquote\7f211618
-Node: Notes about Backquote\7f215542
-Node: Comma\7f216613
-Node: Sharpsign\7f216904
-Node: Sharpsign Backslash\7f221458
-Node: Sharpsign Single-Quote\7f222621
-Node: Sharpsign Left-Parenthesis\7f223094
-Node: Sharpsign Asterisk\7f224614
-Node: Examples of Sharpsign Asterisk\7f225878
-Node: Sharpsign Colon\7f226296
-Node: Sharpsign Dot\7f226812
-Node: Sharpsign B\7f227490
-Node: Sharpsign O\7f227881
-Node: Sharpsign X\7f228288
-Node: Sharpsign R\7f228794
-Node: Sharpsign C\7f230089
-Node: Sharpsign A\7f231168
-Node: Sharpsign S\7f232365
-Node: Sharpsign P\7f233472
-Node: Sharpsign Equal-Sign\7f233889
-Node: Sharpsign Sharpsign\7f234410
-Node: Sharpsign Plus\7f235479
-Node: Sharpsign Minus\7f236521
-Node: Sharpsign Vertical-Bar\7f236881
-Node: Examples of Sharpsign Vertical-Bar\7f237248
-Node: Notes about Style for Sharpsign Vertical-Bar\7f240239
-Node: Sharpsign Less-Than-Sign\7f241209
-Node: Sharpsign Whitespace\7f241647
-Node: Sharpsign Right-Parenthesis\7f242034
-Node: Re-Reading Abbreviated Expressions\7f242334
-Node: Evaluation and Compilation\7f242827
-Node: Evaluation\7f243208
-Node: Introduction to Environments\7f244496
-Node: The Global Environment\7f245354
-Node: Dynamic Environments\7f246005
-Node: Lexical Environments\7f247164
-Node: The Null Lexical Environment\7f248389
-Node: Environment Objects\7f248903
-Node: The Evaluation Model\7f249870
-Node: Form Evaluation\7f250565
-Node: Symbols as Forms\7f250868
-Node: Lexical Variables\7f252916
-Node: Dynamic Variables\7f253947
-Node: Constant Variables\7f255692
-Node: Symbols Naming Both Lexical and Dynamic Variables\7f256408
-Node: Conses as Forms\7f257260
-Node: Special Forms\7f258207
-Node: Macro Forms\7f259721
-Node: Function Forms\7f261547
-Node: Lambda Forms\7f263997
-Node: Self-Evaluating Objects\7f264655
-Node: Examples of Self-Evaluating Objects\7f265377
-Node: Lambda Expressions\7f265838
-Node: Closures and Lexical Binding\7f266477
-Node: Shadowing\7f270233
-Node: Extent\7f273405
-Node: Return Values\7f275671
-Node: Compilation\7f277013
-Node: Compiler Terminology\7f277320
-Node: Compilation Semantics\7f281613
-Node: Compiler Macros\7f282296
-Node: Purpose of Compiler Macros\7f283957
-Node: Naming of Compiler Macros\7f285672
-Node: When Compiler Macros Are Used\7f286650
-Node: Notes about the Implementation of Compiler Macros\7f288291
-Node: Minimal Compilation\7f289408
-Node: Semantic Constraints\7f290584
-Node: File Compilation\7f294238
-Node: Processing of Top Level Forms\7f296211
-Node: Processing of Defining Macros\7f300673
-Node: Constraints on Macros and Compiler Macros\7f303180
-Node: Literal Objects in Compiled Files\7f303980
-Node: Externalizable Objects\7f305390
-Node: Similarity of Literal Objects\7f307018
-Node: Similarity of Aggregate Objects\7f307262
-Node: Definition of Similarity\7f307846
-Node: Extensions to Similarity Rules\7f312714
-Node: Additional Constraints on Externalizable Objects\7f313590
-Node: Exceptional Situations in the Compiler\7f318327
-Node: Declarations\7f320426
-Node: Minimal Declaration Processing Requirements\7f321213
-Node: Declaration Specifiers\7f322379
-Node: Declaration Identifiers\7f322881
-Node: Shorthand notation for Type Declarations\7f323697
-Node: Declaration Scope\7f324064
-Node: Examples of Declaration Scope\7f326037
-Node: Lambda Lists\7f329237
-Node: Ordinary Lambda Lists\7f331669
-Node: Specifiers for the required parameters\7f334135
-Node: Specifiers for optional parameters\7f334985
-Node: A specifier for a rest parameter\7f336166
-Node: Specifiers for keyword parameters\7f337171
-Node: Suppressing Keyword Argument Checking\7f341194
-Node: Examples of Suppressing Keyword Argument Checking\7f341885
-Node: Specifiers for &aux variables\7f343127
-Node: Examples of Ordinary Lambda Lists\7f343978
-Node: Generic Function Lambda Lists\7f347919
-Node: Specialized Lambda Lists\7f349247
-Node: Macro Lambda Lists\7f350554
-Node: Destructuring by Lambda Lists\7f355840
-Node: Data-directed Destructuring by Lambda Lists\7f357031
-Node: Examples of Data-directed Destructuring by Lambda Lists\7f357578
-Node: Lambda-list-directed Destructuring by Lambda Lists\7f358291
-Node: Destructuring Lambda Lists\7f361352
-Node: Boa Lambda Lists\7f362584
-Node: Defsetf Lambda Lists\7f366462
-Node: Deftype Lambda Lists\7f367377
-Node: Define-modify-macro Lambda Lists\7f367995
-Node: Define-method-combination Arguments Lambda Lists\7f368863
-Node: Syntactic Interaction of Documentation Strings and Declarations\7f369709
-Node: Error Checking in Function Calls\7f370460
-Node: Argument Mismatch Detection\7f370731
-Node: Safe and Unsafe Calls\7f371220
-Node: Error Detection Time in Safe Calls\7f373983
-Node: Too Few Arguments\7f374566
-Node: Too Many Arguments\7f375091
-Node: Unrecognized Keyword Arguments\7f375739
-Node: Invalid Keyword Arguments\7f376359
-Node: Odd Number of Keyword Arguments\7f376963
-Node: Destructuring Mismatch\7f377549
-Node: Errors When Calling a Next Method\7f378086
-Node: Traversal Rules and Side Effects\7f379061
-Node: Destructive Operations\7f380307
-Node: Modification of Literal Objects\7f380632
-Node: Transfer of Control during a Destructive Operation\7f383030
-Node: Examples of Transfer of Control during a Destructive Operation\7f383527
-Node: Evaluation and Compilation Dictionary\7f384409
-Node: lambda (Symbol)\7f385092
-Node: lambda\7f386294
-Node: compile\7f387416
-Node: eval\7f390637
-Node: eval-when\7f392579
-Node: load-time-value\7f399022
-Node: quote\7f404840
-Node: compiler-macro-function\7f406424
-Node: define-compiler-macro\7f407395
-Node: defmacro\7f414887
-Node: macro-function\7f421070
-Node: macroexpand\7f423326
-Node: define-symbol-macro\7f428393
-Node: symbol-macrolet\7f430959
-Node: *macroexpand-hook*\7f434090
-Node: proclaim\7f436356
-Node: declaim\7f438480
-Node: declare\7f439293
-Node: ignore\7f443327
-Node: dynamic-extent\7f445364
-Node: type\7f451758
-Node: inline\7f458535
-Node: ftype\7f462361
-Node: declaration\7f463895
-Node: optimize\7f464823
-Node: special\7f466980
-Node: locally\7f471468
-Node: the\7f473644
-Node: special-operator-p\7f476052
-Node: constantp\7f476973
-Node: Types and Classes\7f480013
-Node: Introduction (Types and Classes)\7f480275
-Node: Types\7f482433
-Node: Data Type Definition\7f482645
-Node: Type Relationships\7f483787
-Node: Type Specifiers\7f485712
-Node: Classes\7f493953
-Node: Introduction to Classes\7f494815
-Node: Standard Metaclasses\7f499543
-Node: Defining Classes\7f500502
-Node: Creating Instances of Classes\7f502174
-Node: Inheritance\7f502965
-Node: Examples of Inheritance\7f503429
-Node: Inheritance of Class Options\7f504406
-Node: Determining the Class Precedence List\7f505226
-Node: Topological Sorting\7f507286
-Node: Examples of Class Precedence List Determination\7f509719
-Node: Redefining Classes\7f513273
-Node: Modifying the Structure of Instances\7f516377
-Node: Initializing Newly Added Local Slots (Redefining Classes)\7f517562
-Node: Customizing Class Redefinition\7f519463
-Node: Integrating Types and Classes\7f520542
-Node: Types and Classes Dictionary\7f526807
-Node: nil (Type)\7f527576
-Node: boolean\7f528032
-Node: function (System Class)\7f528832
-Node: compiled-function\7f533548
-Node: generic-function\7f534387
-Node: standard-generic-function\7f535424
-Node: class\7f535947
-Node: built-in-class\7f536483
-Node: structure-class\7f537409
-Node: standard-class\7f537824
-Node: method\7f538222
-Node: standard-method\7f539361
-Node: structure-object\7f539792
-Node: standard-object\7f540391
-Node: method-combination\7f540829
-Node: t (System Class)\7f541488
-Node: satisfies\7f541854
-Node: member (Type Specifier)\7f543027
-Node: not (Type Specifier)\7f544042
-Node: and (Type Specifier)\7f544758
-Node: or (Type Specifier)\7f545596
-Node: values (Type Specifier)\7f546627
-Node: eql (Type Specifier)\7f547894
-Node: coerce\7f548669
-Node: deftype\7f553331
-Node: subtypep\7f556484
-Node: type-of\7f563450
-Node: typep\7f566367
-Node: type-error\7f569776
-Node: type-error-datum\7f570479
-Node: simple-type-error\7f571825
-Node: Data and Control Flow\7f572569
-Node: Generalized Reference\7f572834
-Node: Overview of Places and Generalized Reference\7f573161
-Node: Evaluation of Subforms to Places\7f575480
-Node: Examples of Evaluation of Subforms to Places\7f577985
-Node: Setf Expansions\7f578711
-Node: Examples of Setf Expansions\7f580781
-Node: Kinds of Places\7f582666
-Node: Variable Names as Places\7f583304
-Node: Function Call Forms as Places\7f583582
-Node: VALUES Forms as Places\7f591704
-Node: THE Forms as Places\7f592842
-Node: APPLY Forms as Places\7f593301
-Node: Setf Expansions and Places\7f594670
-Node: Macro Forms as Places\7f595090
-Node: Symbol Macros as Places\7f595624
-Node: Other Compound Forms as Places\7f596003
-Node: Treatment of Other Macros Based on SETF\7f597034
-Node: Transfer of Control to an Exit Point\7f598451
-Node: Data and Control Flow Dictionary\7f600586
-Node: apply\7f601820
-Node: defun\7f603853
-Node: fdefinition\7f607600
-Node: fboundp\7f609447
-Node: fmakunbound\7f611260
-Node: flet\7f612245
-Node: funcall\7f620119
-Node: function (Special Operator)\7f621828
-Node: function-lambda-expression\7f623911
-Node: functionp\7f627159
-Node: compiled-function-p\7f628117
-Node: call-arguments-limit\7f629264
-Node: lambda-list-keywords\7f629897
-Node: lambda-parameters-limit\7f630640
-Node: defconstant\7f631291
-Node: defparameter\7f634137
-Node: destructuring-bind\7f640716
-Node: let\7f642039
-Node: progv\7f645358
-Node: setq\7f646867
-Node: psetq\7f648555
-Node: block\7f650545
-Node: catch\7f652357
-Node: go\7f655050
-Node: return-from\7f656492
-Node: return\7f658776
-Node: tagbody\7f659769
-Node: throw\7f662181
-Node: unwind-protect\7f664850
-Node: nil\7f670087
-Node: not\7f670482
-Node: t\7f671332
-Node: eq\7f672319
-Node: eql\7f674742
-Node: equal\7f677723
-Node: equalp\7f681330
-Node: identity\7f685272
-Node: complement\7f686031
-Node: constantly\7f687735
-Node: every\7f688709
-Node: and\7f691704
-Node: cond\7f693464
-Node: if\7f695109
-Node: or\7f696366
-Node: when\7f697782
-Node: case\7f700382
-Node: typecase\7f705491
-Node: multiple-value-bind\7f711071
-Node: multiple-value-call\7f712938
-Node: multiple-value-list\7f714194
-Node: multiple-value-prog1\7f715015
-Node: multiple-value-setq\7f715972
-Node: values\7f717586
-Node: values-list\7f719522
-Node: multiple-values-limit\7f720504
-Node: nth-value\7f721330
-Node: prog\7f722623
-Node: prog1\7f726375
-Node: progn\7f728534
-Node: define-modify-macro\7f729921
-Node: defsetf\7f732405
-Node: define-setf-expander\7f738548
-Node: get-setf-expansion\7f743384
-Node: setf\7f745138
-Node: shiftf\7f747602
-Node: rotatef\7f750209
-Node: control-error\7f751930
-Node: program-error\7f752551
-Node: undefined-function\7f753097
-Node: Iteration\7f753702
-Node: The LOOP Facility\7f753876
-Node: Overview of the Loop Facility\7f754342
-Node: Simple vs Extended Loop\7f755123
-Node: Simple Loop\7f755424
-Node: Extended Loop\7f756117
-Node: Loop Keywords\7f756748
-Node: Parsing Loop Clauses\7f757682
-Node: Expanding Loop Forms\7f759305
-Node: Summary of Loop Clauses\7f762002
-Node: Summary of Variable Initialization and Stepping Clauses\7f762303
-Node: Summary of Value Accumulation Clauses\7f763136
-Node: Summary of Termination Test Clauses\7f764926
-Node: Summary of Unconditional Execution Clauses\7f766633
-Node: Summary of Conditional Execution Clauses\7f767353
-Node: Summary of Miscellaneous Clauses\7f768445
-Node: Order of Execution\7f769138
-Node: Destructuring\7f771010
-Node: Restrictions on Side-Effects\7f775430
-Node: Variable Initialization and Stepping Clauses\7f775667
-Node: Iteration Control\7f776519
-Node: The for-as-arithmetic subclause\7f779433
-Node: Examples of for-as-arithmetic subclause\7f783281
-Node: The for-as-in-list subclause\7f784034
-Node: Examples of for-as-in-list subclause\7f784828
-Node: The for-as-on-list subclause\7f785617
-Node: Examples of for-as-on-list subclause\7f786370
-Node: The for-as-equals-then subclause\7f786991
-Node: Examples of for-as-equals-then subclause\7f787749
-Node: The for-as-across subclause\7f788206
-Node: Examples of for-as-across subclause\7f788908
-Node: The for-as-hash subclause\7f789295
-Node: The for-as-package subclause\7f791517
-Node: Examples of for-as-package subclause\7f794081
-Node: Local Variable Initializations\7f794702
-Node: Examples of WITH clause\7f797545
-Node: Value Accumulation Clauses\7f798587
-Node: Examples of COLLECT clause\7f804424
-Node: Examples of APPEND and NCONC clauses\7f805177
-Node: Examples of COUNT clause\7f805798
-Node: Examples of MAXIMIZE and MINIMIZE clauses\7f806120
-Node: Examples of SUM clause\7f806991
-Node: Termination Test Clauses\7f807397
-Node: Examples of REPEAT clause\7f811567
-Node: Examples of ALWAYS\7f812094
-Node: Examples of WHILE and UNTIL clauses\7f814117
-Node: Unconditional Execution Clauses\7f814912
-Node: Examples of unconditional execution\7f815805
-Node: Conditional Execution Clauses\7f816302
-Node: Examples of WHEN clause\7f818007
-Node: Miscellaneous Clauses\7f819686
-Node: Control Transfer Clauses\7f820001
-Node: Examples of NAMED clause\7f820829
-Node: Initial and Final Execution\7f821220
-Node: Examples of Miscellaneous Loop Features\7f822849
-Node: Examples of clause grouping\7f823919
-Node: Notes about Loop\7f826366
-Node: Iteration Dictionary\7f827388
-Node: do\7f827593
-Node: dotimes\7f836034
-Node: dolist\7f839489
-Node: loop\7f841711
-Node: loop-finish\7f847171
-Node: Objects\7f849997
-Node: Object Creation and Initialization\7f850301
-Node: Initialization Arguments\7f854213
-Node: Declaring the Validity of Initialization Arguments\7f856820
-Node: Defaulting of Initialization Arguments\7f860319
-Node: Rules for Initialization Arguments\7f863590
-Node: Shared-Initialize\7f867442
-Node: Initialize-Instance\7f870124
-Node: Definitions of Make-Instance and Initialize-Instance\7f872859
-Node: Changing the Class of an Instance\7f874957
-Node: Modifying the Structure of the Instance\7f876209
-Node: Initializing Newly Added Local Slots (Changing the Class of an Instance)\7f877147
-Node: Customizing the Change of Class of an Instance\7f878884
-Node: Reinitializing an Instance\7f879687
-Node: Customizing Reinitialization\7f881150
-Node: Meta-Objects\7f881814
-Node: Standard Meta-objects\7f882340
-Node: Slots\7f883379
-Node: Introduction to Slots\7f883603
-Node: Accessing Slots\7f886241
-Node: Inheritance of Slots and Slot Options\7f888818
-Node: Generic Functions and Methods\7f893560
-Node: Introduction to Generic Functions\7f894055
-Node: Introduction to Methods\7f897558
-Node: Agreement on Parameter Specializers and Qualifiers\7f904020
-Node: Congruent Lambda-lists for all Methods of a Generic Function\7f905017
-Node: Keyword Arguments in Generic Functions and Methods\7f907159
-Node: Examples of Keyword Arguments in Generic Functions and Methods\7f908851
-Node: Method Selection and Combination\7f910190
-Node: Determining the Effective Method\7f911656
-Node: Selecting the Applicable Methods\7f912250
-Node: Sorting the Applicable Methods by Precedence Order\7f912591
-Node: Applying method combination to the sorted list of applicable methods\7f914656
-Node: Standard Method Combination\7f916823
-Node: Declarative Method Combination\7f921770
-Node: Built-in Method Combination Types\7f922681
-Node: Inheritance of Methods\7f926755
-Node: Objects Dictionary\7f927326
-Node: function-keywords\7f928334
-Node: ensure-generic-function\7f929961
-Node: allocate-instance\7f933269
-Node: reinitialize-instance\7f934796
-Node: shared-initialize\7f937031
-Node: update-instance-for-different-class\7f941539
-Node: update-instance-for-redefined-class\7f945677
-Node: change-class\7f950951
-Node: slot-boundp\7f954973
-Node: slot-exists-p\7f956755
-Node: slot-makunbound\7f957557
-Node: slot-missing\7f959095
-Node: slot-unbound\7f961434
-Node: slot-value\7f963106
-Node: method-qualifiers\7f965917
-Node: no-applicable-method\7f966714
-Node: no-next-method\7f967839
-Node: remove-method\7f969042
-Node: make-instance\7f969864
-Node: make-instances-obsolete\7f971279
-Node: make-load-form\7f972594
-Node: make-load-form-saving-slots\7f984111
-Node: with-accessors\7f986059
-Node: with-slots\7f989000
-Node: defclass\7f992371
-Node: defgeneric\7f1004581
-Node: defmethod\7f1015268
-Node: find-class\7f1022161
-Node: next-method-p\7f1024140
-Node: call-method\7f1025245
-Node: call-next-method\7f1028261
-Node: compute-applicable-methods\7f1031322
-Node: define-method-combination\7f1032384
-Node: find-method\7f1056137
-Node: add-method\7f1058794
-Node: initialize-instance\7f1060028
-Node: class-name\7f1061820
-Node: setf class-name\7f1062577
-Node: class-of\7f1063206
-Node: unbound-slot\7f1064210
-Node: unbound-slot-instance\7f1064878
-Node: Structures\7f1065446
-Node: Structures Dictionary\7f1065591
-Node: defstruct\7f1065771
-Node: copy-structure\7f1106547
-Node: Conditions\7f1107143
-Node: Condition System Concepts\7f1107318
-Node: Condition Types\7f1110927
-Node: Serious Conditions\7f1113346
-Node: Creating Conditions\7f1113727
-Node: Condition Designators\7f1114280
-Node: Printing Conditions\7f1116120
-Node: Recommended Style in Condition Reporting\7f1117463
-Node: Capitalization and Punctuation in Condition Reports\7f1118592
-Node: Leading and Trailing Newlines in Condition Reports\7f1119315
-Node: Embedded Newlines in Condition Reports\7f1120277
-Node: Note about Tabs in Condition Reports\7f1121450
-Node: Mentioning Containing Function in Condition Reports\7f1122075
-Node: Signaling and Handling Conditions\7f1122560
-Node: Signaling\7f1124826
-Node: Resignaling a Condition\7f1126016
-Node: Restarts\7f1127076
-Node: Interactive Use of Restarts\7f1129253
-Node: Interfaces to Restarts\7f1130449
-Node: Restart Tests\7f1131345
-Node: Associating a Restart with a Condition\7f1131825
-Node: Assertions\7f1132724
-Node: Notes about the Condition System`s Background\7f1133221
-Node: Conditions Dictionary\7f1133712
-Node: condition\7f1134727
-Node: warning\7f1136521
-Node: style-warning\7f1136878
-Node: serious-condition\7f1138082
-Node: error (Condition Type)\7f1139315
-Node: cell-error\7f1139680
-Node: cell-error-name\7f1140286
-Node: parse-error\7f1141281
-Node: storage-condition\7f1141751
-Node: assert\7f1143337
-Node: error\7f1147298
-Node: cerror\7f1150994
-Node: check-type\7f1156124
-Node: simple-error\7f1160414
-Node: invalid-method-error\7f1160913
-Node: method-combination-error\7f1162470
-Node: signal\7f1163600
-Node: simple-condition\7f1166161
-Node: simple-condition-format-control\7f1167090
-Node: warn\7f1168470
-Node: simple-warning\7f1170904
-Node: invoke-debugger\7f1171377
-Node: break\7f1172879
-Node: *debugger-hook*\7f1175321
-Node: *break-on-signals*\7f1177816
-Node: handler-bind\7f1180456
-Node: handler-case\7f1183047
-Node: ignore-errors\7f1188248
-Node: define-condition\7f1190142
-Node: make-condition\7f1201894
-Node: restart\7f1203203
-Node: compute-restarts\7f1203835
-Node: find-restart\7f1206600
-Node: invoke-restart\7f1208605
-Node: invoke-restart-interactively\7f1210346
-Node: restart-bind\7f1212665
-Node: restart-case\7f1216713
-Node: restart-name\7f1226531
-Node: with-condition-restarts\7f1227497
-Node: with-simple-restart\7f1228834
-Node: abort (Restart)\7f1232322
-Node: continue\7f1233316
-Node: muffle-warning\7f1234477
-Node: store-value\7f1236100
-Node: use-value\7f1237337
-Node: abort (Function)\7f1237974
-Node: Symbols\7f1244311
-Node: Symbol Concepts\7f1244467
-Node: Symbols Dictionary\7f1245054
-Node: symbol\7f1245484
-Node: keyword\7f1250497
-Node: symbolp\7f1251097
-Node: keywordp\7f1251851
-Node: make-symbol\7f1252735
-Node: copy-symbol\7f1254350
-Node: gensym\7f1256795
-Node: *gensym-counter*\7f1259107
-Node: gentemp\7f1259877
-Node: symbol-function\7f1262729
-Node: symbol-name\7f1265698
-Node: symbol-package\7f1266401
-Node: symbol-plist\7f1268258
-Node: symbol-value\7f1269474
-Node: get\7f1271489
-Node: remprop\7f1274749
-Node: boundp\7f1277377
-Node: makunbound\7f1278371
-Node: set\7f1279138
-Node: unbound-variable\7f1280882
-Node: Packages\7f1281453
-Node: Package Concepts\7f1281620
-Node: Introduction to Packages\7f1281833
-Node: Package Names and Nicknames\7f1283633
-Node: Symbols in a Package\7f1284404
-Node: Internal and External Symbols\7f1284617
-Node: Package Inheritance\7f1285532
-Node: Accessibility of Symbols in a Package\7f1286482
-Node: Locating a Symbol in a Package\7f1288095
-Node: Prevention of Name Conflicts in Packages\7f1288714
-Node: Standardized Packages\7f1292078
-Node: The COMMON-LISP Package\7f1293018
-Node: Constraints on the COMMON-LISP Package for Conforming Implementations\7f1294353
-Node: Constraints on the COMMON-LISP Package for Conforming Programs\7f1295899
-Node: Some Exceptions to Constraints on the COMMON-LISP Package for Conforming Programs\7f1298010
-Node: The COMMON-LISP-USER Package\7f1299857
-Node: The KEYWORD Package\7f1300456
-Node: Interning a Symbol in the KEYWORD Package\7f1301319
-Node: Notes about The KEYWORD Package\7f1301909
-Node: Implementation-Defined Packages\7f1302832
-Node: Packages Dictionary\7f1303401
-Node: package\7f1304073
-Node: export\7f1304526
-Node: find-symbol\7f1307608
-Node: find-package\7f1310037
-Node: find-all-symbols\7f1311063
-Node: import\7f1312059
-Node: list-all-packages\7f1314566
-Node: rename-package\7f1315240
-Node: shadow\7f1316528
-Node: shadowing-import\7f1318907
-Node: delete-package\7f1320839
-Node: make-package\7f1325858
-Node: with-package-iterator\7f1327910
-Node: unexport\7f1333557
-Node: unintern\7f1335117
-Node: in-package\7f1337212
-Node: unuse-package\7f1338185
-Node: use-package\7f1339602
-Node: defpackage\7f1341691
-Node: do-symbols\7f1350040
-Node: intern\7f1353622
-Node: package-name\7f1355967
-Node: package-nicknames\7f1357023
-Node: package-shadowing-symbols\7f1357802
-Node: package-use-list\7f1359034
-Node: package-used-by-list\7f1359932
-Node: packagep\7f1360806
-Node: *package*\7f1361459
-Node: package-error\7f1362832
-Node: package-error-package\7f1363491
-Node: Numbers (Numbers)\7f1364189
-Node: Number Concepts\7f1364355
-Node: Numeric Operations\7f1364733
-Node: Associativity and Commutativity in Numeric Operations\7f1366757
-Node: Examples of Associativity and Commutativity in Numeric Operations\7f1367880
-Node: Contagion in Numeric Operations\7f1369540
-Node: Viewing Integers as Bits and Bytes\7f1370057
-Node: Logical Operations on Integers\7f1370311
-Node: Byte Operations on Integers\7f1371392
-Node: Implementation-Dependent Numeric Constants\7f1372189
-Node: Rational Computations\7f1373377
-Node: Rule of Unbounded Rational Precision\7f1373789
-Node: Rule of Canonical Representation for Rationals\7f1374244
-Node: Rule of Float Substitutability\7f1375355
-Node: Floating-point Computations\7f1377758
-Node: Rule of Float and Rational Contagion\7f1378238
-Node: Examples of Rule of Float and Rational Contagion\7f1379135
-Node: Rule of Float Approximation\7f1380199
-Node: Rule of Float Underflow and Overflow\7f1381381
-Node: Rule of Float Precision Contagion\7f1381823
-Node: Complex Computations\7f1382174
-Node: Rule of Complex Substitutability\7f1382661
-Node: Rule of Complex Contagion\7f1383062
-Node: Rule of Canonical Representation for Complex Rationals\7f1383469
-Node: Examples of Rule of Canonical Representation for Complex Rationals\7f1384333
-Node: Principal Values and Branch Cuts\7f1384998
-Node: Interval Designators\7f1387034
-Node: Random-State Operations\7f1388549
-Node: Numbers Dictionary\7f1388900
-Node: number\7f1390271
-Node: complex (System Class)\7f1391433
-Node: real\7f1393677
-Node: float (System Class)\7f1394836
-Node: short-float\7f1397498
-Node: rational (System Class)\7f1401489
-Node: ratio\7f1402525
-Node: integer\7f1403124
-Node: signed-byte\7f1404496
-Node: unsigned-byte\7f1405533
-Node: mod (System Class)\7f1406663
-Node: bit (System Class)\7f1407409
-Node: fixnum\7f1407770
-Node: bignum\7f1408261
-Node: =\7f1408567
-Node: max\7f1411973
-Node: minusp\7f1414051
-Node: zerop\7f1414983
-Node: floor\7f1415970
-Node: sin\7f1420833
-Node: asin\7f1421664
-Node: pi\7f1428500
-Node: sinh\7f1429610
-Node: *\7f1434158
-Node: +\7f1434996
-Node: -\7f1435797
-Node: /\7f1436958
-Node: 1+\7f1438589
-Node: abs\7f1439555
-Node: evenp\7f1441002
-Node: exp\7f1441920
-Node: gcd\7f1445121
-Node: incf\7f1446157
-Node: lcm\7f1447353
-Node: log\7f1448471
-Node: mod (Function)\7f1450640
-Node: signum\7f1451962
-Node: sqrt\7f1453634
-Node: random-state\7f1455719
-Node: make-random-state\7f1456564
-Node: random\7f1458507
-Node: random-state-p\7f1460008
-Node: *random-state*\7f1460781
-Node: numberp\7f1462211
-Node: cis\7f1462886
-Node: complex\7f1463462
-Node: complexp\7f1465115
-Node: conjugate\7f1465770
-Node: phase\7f1466549
-Node: realpart\7f1468109
-Node: upgraded-complex-part-type\7f1469108
-Node: realp\7f1470092
-Node: numerator\7f1470725
-Node: rational (Function)\7f1471790
-Node: rationalp\7f1473354
-Node: ash\7f1474023
-Node: integer-length\7f1475530
-Node: integerp\7f1477194
-Node: parse-integer\7f1477845
-Node: boole\7f1479962
-Node: boole-1\7f1484483
-Node: logand\7f1485594
-Node: logbitp\7f1489575
-Node: logcount\7f1490770
-Node: logtest\7f1492189
-Node: byte\7f1493262
-Node: deposit-field\7f1494517
-Node: dpb\7f1495547
-Node: ldb\7f1496995
-Node: ldb-test\7f1498605
-Node: mask-field\7f1499446
-Node: most-positive-fixnum\7f1501104
-Node: decode-float\7f1501778
-Node: float\7f1507557
-Node: floatp\7f1508496
-Node: most-positive-short-float\7f1509130
-Node: short-float-epsilon\7f1513431
-Node: arithmetic-error\7f1514816
-Node: arithmetic-error-operands\7f1515570
-Node: division-by-zero\7f1516491
-Node: floating-point-invalid-operation\7f1516969
-Node: floating-point-inexact\7f1517757
-Node: floating-point-overflow\7f1518512
-Node: floating-point-underflow\7f1519021
-Node: Characters\7f1519504
-Node: Character Concepts\7f1519680
-Node: Introduction to Characters\7f1520174
-Node: Introduction to Scripts and Repertoires\7f1521581
-Node: Character Scripts\7f1521889
-Node: Character Repertoires\7f1522902
-Node: Character Attributes\7f1523813
-Node: Character Categories\7f1524821
-Node: Graphic Characters\7f1526044
-Node: Alphabetic Characters\7f1526971
-Node: Characters With Case\7f1527634
-Node: Uppercase Characters\7f1528088
-Node: Lowercase Characters\7f1528543
-Node: Corresponding Characters in the Other Case\7f1529017
-Node: Case of Implementation-Defined Characters\7f1529548
-Node: Numeric Characters\7f1530049
-Node: Alphanumeric Characters\7f1530557
-Node: Digits in a Radix\7f1530876
-Node: Identity of Characters\7f1531604
-Node: Ordering of Characters\7f1531874
-Node: Character Names\7f1533664
-Node: Treatment of Newline during Input and Output\7f1534807
-Node: Character Encodings\7f1535358
-Node: Documentation of Implementation-Defined Scripts\7f1536156
-Node: Characters Dictionary\7f1537627
-Node: character (System Class)\7f1538130
-Node: base-char\7f1538741
-Node: standard-char\7f1540725
-Node: extended-char\7f1541265
-Node: char=\7f1541726
-Node: character\7f1547890
-Node: characterp\7f1548769
-Node: alpha-char-p\7f1549707
-Node: alphanumericp\7f1550878
-Node: digit-char\7f1552273
-Node: digit-char-p\7f1553393
-Node: graphic-char-p\7f1554893
-Node: standard-char-p\7f1555779
-Node: char-upcase\7f1556627
-Node: upper-case-p\7f1559065
-Node: char-code\7f1560614
-Node: char-int\7f1561341
-Node: code-char\7f1562337
-Node: char-code-limit\7f1563099
-Node: char-name\7f1563759
-Node: name-char\7f1565683
-Node: Conses\7f1566561
-Node: Cons Concepts\7f1566709
-Node: Conses as Trees\7f1567246
-Node: General Restrictions on Parameters that must be Trees\7f1568215
-Node: Conses as Lists\7f1568649
-Node: Lists as Association Lists\7f1570049
-Node: Lists as Sets\7f1570577
-Node: General Restrictions on Parameters that must be Lists\7f1571128
-Node: Conses Dictionary\7f1571785
-Node: list (System Class)\7f1572547
-Node: null (System Class)\7f1573781
-Node: cons (System Class)\7f1574273
-Node: atom (Type)\7f1575503
-Node: cons\7f1575743
-Node: consp\7f1576660
-Node: atom\7f1577382
-Node: rplaca\7f1578089
-Node: car\7f1579229
-Node: copy-tree\7f1585615
-Node: sublis\7f1587244
-Node: subst\7f1590990
-Node: tree-equal\7f1595379
-Node: copy-list\7f1597162
-Node: list (Function)\7f1598484
-Node: list-length\7f1600112
-Node: listp\7f1602023
-Node: make-list\7f1602828
-Node: push\7f1603790
-Node: pop\7f1605036
-Node: first\7f1606335
-Node: nth\7f1609212
-Node: endp\7f1610271
-Node: null\7f1611672
-Node: nconc\7f1612482
-Node: append\7f1614623
-Node: revappend\7f1615757
-Node: butlast\7f1617949
-Node: last\7f1619785
-Node: ldiff\7f1621553
-Node: nthcdr\7f1625188
-Node: rest\7f1626323
-Node: member (Function)\7f1627307
-Node: mapc\7f1629610
-Node: acons\7f1633848
-Node: assoc\7f1634867
-Node: copy-alist\7f1638119
-Node: pairlis\7f1639397
-Node: rassoc\7f1640922
-Node: get-properties\7f1643056
-Node: getf\7f1644440
-Node: remf\7f1647311
-Node: intersection\7f1648666
-Node: adjoin\7f1652608
-Node: pushnew\7f1654554
-Node: set-difference\7f1657299
-Node: set-exclusive-or\7f1660676
-Node: subsetp\7f1663774
-Node: union\7f1665800
-Node: Arrays\7f1668901
-Node: Array Concepts\7f1669047
-Node: Array Elements\7f1669235
-Node: Array Indices\7f1669792
-Node: Array Dimensions\7f1670207
-Node: Implementation Limits on Individual Array Dimensions\7f1670797
-Node: Array Rank\7f1671222
-Node: Vectors\7f1671707
-Node: Fill Pointers\7f1671913
-Node: Multidimensional Arrays\7f1672645
-Node: Storage Layout for Multidimensional Arrays\7f1672856
-Node: Implementation Limits on Array Rank\7f1673370
-Node: Specialized Arrays\7f1673744
-Node: Array Upgrading\7f1675061
-Node: Required Kinds of Specialized Arrays\7f1676443
-Node: Arrays Dictionary\7f1677938
-Node: array\7f1678753
-Node: simple-array\7f1681805
-Node: vector (System Class)\7f1683758
-Node: simple-vector\7f1685858
-Node: bit-vector\7f1686871
-Node: simple-bit-vector\7f1687916
-Node: make-array\7f1688902
-Node: adjust-array\7f1697581
-Node: adjustable-array-p\7f1705592
-Node: aref\7f1706568
-Node: array-dimension\7f1708259
-Node: array-dimensions\7f1709126
-Node: array-element-type\7f1709980
-Node: array-has-fill-pointer-p\7f1711372
-Node: array-displacement\7f1712530
-Node: array-in-bounds-p\7f1714211
-Node: array-rank\7f1715392
-Node: array-row-major-index\7f1716170
-Node: array-total-size\7f1717694
-Node: arrayp\7f1718976
-Node: fill-pointer\7f1719739
-Node: row-major-aref\7f1720898
-Node: upgraded-array-element-type\7f1721996
-Node: array-dimension-limit\7f1723603
-Node: array-rank-limit\7f1724132
-Node: array-total-size-limit\7f1724626
-Node: simple-vector-p\7f1725394
-Node: svref\7f1726155
-Node: vector\7f1727229
-Node: vector-pop\7f1728135
-Node: vector-push\7f1729406
-Node: vectorp\7f1732238
-Node: bit (Array)\7f1732946
-Node: bit-and\7f1734292
-Node: bit-vector-p\7f1738490
-Node: simple-bit-vector-p\7f1739295
-Node: Strings\7f1740005
-Node: String Concepts\7f1740158
-Node: Implications of Strings Being Arrays\7f1740374
-Node: Subtypes of STRING\7f1740863
-Node: Strings Dictionary\7f1741270
-Node: string (System Class)\7f1741609
-Node: base-string\7f1742681
-Node: simple-string\7f1743631
-Node: simple-base-string\7f1744674
-Node: simple-string-p\7f1745588
-Node: char\7f1746349
-Node: string\7f1747896
-Node: string-upcase\7f1749163
-Node: string-trim\7f1753224
-Node: string=\7f1754871
-Node: stringp\7f1760411
-Node: make-string\7f1761032
-Node: Sequences\7f1761976
-Node: Sequence Concepts\7f1762173
-Node: General Restrictions on Parameters that must be Sequences\7f1763810
-Node: Rules about Test Functions\7f1764195
-Node: Satisfying a Two-Argument Test\7f1764464
-Node: Examples of Satisfying a Two-Argument Test\7f1766921
-Node: Satisfying a One-Argument Test\7f1768223
-Node: Examples of Satisfying a One-Argument Test\7f1770095
-Node: Sequences Dictionary\7f1770692
-Node: sequence\7f1771131
-Node: copy-seq\7f1771838
-Node: elt\7f1772999
-Node: fill\7f1774085
-Node: make-sequence\7f1775484
-Node: subseq\7f1777598
-Node: map\7f1779695
-Node: map-into\7f1782562
-Node: reduce\7f1785450
-Node: count\7f1788762
-Node: length\7f1790858
-Node: reverse\7f1791849
-Node: sort\7f1793997
-Node: find\7f1799450
-Node: position\7f1802018
-Node: search\7f1804179
-Node: mismatch\7f1806112
-Node: replace\7f1808424
-Node: substitute\7f1810739
-Node: concatenate\7f1816693
-Node: merge\7f1818871
-Node: remove\7f1823021
-Node: remove-duplicates\7f1829433
-Node: Hash Tables\7f1832943
-Node: Hash Table Concepts\7f1833119
-Node: Hash-Table Operations\7f1833351
-Node: Modifying Hash Table Keys\7f1835369
-Node: Visible Modification of Objects with respect to EQ and EQL\7f1837278
-Node: Visible Modification of Objects with respect to EQUAL\7f1837739
-Node: Visible Modification of Conses with respect to EQUAL\7f1838334
-Node: Visible Modification of Bit Vectors and Strings with respect to EQUAL\7f1838821
-Node: Visible Modification of Objects with respect to EQUALP\7f1839482
-Node: Visible Modification of Structures with respect to EQUALP\7f1840092
-Node: Visible Modification of Arrays with respect to EQUALP\7f1840573
-Node: Visible Modification of Hash Tables with respect to EQUALP\7f1841177
-Node: Visible Modifications by Language Extensions\7f1841886
-Node: Hash Tables Dictionary\7f1842646
-Node: hash-table\7f1843068
-Node: make-hash-table\7f1843845
-Node: hash-table-p\7f1846765
-Node: hash-table-count\7f1847512
-Node: hash-table-rehash-size\7f1848911
-Node: hash-table-rehash-threshold\7f1850429
-Node: hash-table-size\7f1851481
-Node: hash-table-test\7f1852259
-Node: gethash\7f1853122
-Node: remhash\7f1855289
-Node: maphash\7f1856137
-Node: with-hash-table-iterator\7f1857980
-Node: clrhash\7f1861417
-Node: sxhash\7f1862271
-Node: Filenames\7f1865253
-Node: Overview of Filenames\7f1865457
-Node: Namestrings as Filenames\7f1866256
-Node: Pathnames as Filenames\7f1867349
-Node: Parsing Namestrings Into Pathnames\7f1870698
-Node: Pathnames\7f1871440
-Node: Pathname Components\7f1871678
-Node: The Pathname Host Component\7f1872166
-Node: The Pathname Device Component\7f1872474
-Node: The Pathname Directory Component\7f1872855
-Node: The Pathname Name Component\7f1873204
-Node: The Pathname Type Component\7f1873521
-Node: The Pathname Version Component\7f1873934
-Node: Interpreting Pathname Component Values\7f1874583
-Node: Strings in Component Values\7f1875787
-Node: Special Characters in Pathname Components\7f1876058
-Node: Case in Pathname Components\7f1876962
-Node: Local Case in Pathname Components\7f1877749
-Node: Common Case in Pathname Components\7f1878548
-Node: Special Pathname Component Values\7f1879341
-Node: NIL as a Component Value\7f1879609
-Node: ->WILD as a Component Value\7f1880153
-Node: ->UNSPECIFIC as a Component Value\7f1881184
-Node: Relation between component values NIL and ->UNSPECIFIC\7f1882575
-Node: Restrictions on Wildcard Pathnames\7f1883422
-Node: Restrictions on Examining Pathname Components\7f1884285
-Node: Restrictions on Examining a Pathname Host Component\7f1885333
-Node: Restrictions on Examining a Pathname Device Component\7f1885772
-Node: Restrictions on Examining a Pathname Directory Component\7f1886476
-Node: Directory Components in Non-Hierarchical File Systems\7f1890002
-Node: Restrictions on Examining a Pathname Name Component\7f1890650
-Node: Restrictions on Examining a Pathname Type Component\7f1891077
-Node: Restrictions on Examining a Pathname Version Component\7f1891505
-Node: Notes about the Pathname Version Component\7f1892484
-Node: Restrictions on Constructing Pathnames\7f1893096
-Node: Merging Pathnames\7f1894638
-Node: Examples of Merging Pathnames\7f1895416
-Node: Logical Pathnames\7f1896296
-Node: Syntax of Logical Pathname Namestrings\7f1896535
-Node: Additional Information about Parsing Logical Pathname Namestrings\7f1898475
-Node: The Host part of a Logical Pathname Namestring\7f1898865
-Node: The Device part of a Logical Pathname Namestring\7f1899510
-Node: The Directory part of a Logical Pathname Namestring\7f1900041
-Node: The Type part of a Logical Pathname Namestring\7f1900639
-Node: The Version part of a Logical Pathname Namestring\7f1901134
-Node: Wildcard Words in a Logical Pathname Namestring\7f1901786
-Node: Lowercase Letters in a Logical Pathname Namestring\7f1902301
-Node: Other Syntax in a Logical Pathname Namestring\7f1902741
-Node: Logical Pathname Components\7f1903256
-Node: Unspecific Components of a Logical Pathname\7f1903563
-Node: Null Strings as Components of a Logical Pathname\7f1903995
-Node: Filenames Dictionary\7f1904357
-Node: pathname (System Class)\7f1904913
-Node: logical-pathname (System Class)\7f1905357
-Node: pathname\7f1905980
-Node: make-pathname\7f1908718
-Node: pathnamep\7f1913243
-Node: pathname-host\7f1914123
-Node: load-logical-pathname-translations\7f1918886
-Node: logical-pathname-translations\7f1920745
-Node: logical-pathname\7f1928794
-Node: *default-pathname-defaults*\7f1930166
-Node: namestring\7f1931389
-Node: parse-namestring\7f1935356
-Node: wild-pathname-p\7f1940118
-Node: pathname-match-p\7f1942251
-Node: translate-logical-pathname\7f1943474
-Node: translate-pathname\7f1946158
-Node: merge-pathnames\7f1952787
-Node: Files\7f1957429
-Node: File System Concepts\7f1957580
-Node: Coercion of Streams to Pathnames\7f1958564
-Node: File Operations on Open and Closed Streams\7f1959501
-Node: Truenames\7f1960741
-Node: Examples of Truenames\7f1961656
-Node: Files Dictionary\7f1963226
-Node: directory\7f1963543
-Node: probe-file\7f1965097
-Node: ensure-directories-exist\7f1966363
-Node: truename\7f1967994
-Node: file-author\7f1970636
-Node: file-write-date\7f1971667
-Node: rename-file\7f1972937
-Node: delete-file\7f1975471
-Node: file-error\7f1977278
-Node: file-error-pathname\7f1978037
-Node: Streams\7f1978586
-Node: Stream Concepts\7f1978736
-Node: Introduction to Streams\7f1979022
-Node: Abstract Classifications of Streams (Introduction to Streams)\7f1980229
-Node: Input\7f1980484
-Node: Open and Closed Streams\7f1982112
-Node: Interactive Streams\7f1983068
-Node: Abstract Classifications of Streams\7f1984464
-Node: File Streams\7f1984696
-Node: Other Subclasses of Stream\7f1985400
-Node: Stream Variables\7f1986616
-Node: Stream Arguments to Standardized Functions\7f1987900
-Node: Restrictions on Composite Streams\7f1990428
-Node: Streams Dictionary\7f1990935
-Node: stream\7f1992212
-Node: broadcast-stream\7f1992805
-Node: concatenated-stream\7f1995590
-Node: echo-stream\7f1996835
-Node: file-stream\7f1997591
-Node: string-stream\7f1998159
-Node: synonym-stream\7f1998782
-Node: two-way-stream\7f1999606
-Node: input-stream-p\7f2000162
-Node: interactive-stream-p\7f2001281
-Node: open-stream-p\7f2002370
-Node: stream-element-type\7f2003270
-Node: streamp\7f2004636
-Node: read-byte\7f2005299
-Node: write-byte\7f2006741
-Node: peek-char\7f2007866
-Node: read-char\7f2010678
-Node: read-char-no-hang\7f2012513
-Node: terpri\7f2014718
-Node: unread-char\7f2016286
-Node: write-char\7f2018259
-Node: read-line\7f2019144
-Node: write-string\7f2021165
-Node: read-sequence\7f2022765
-Node: write-sequence\7f2025066
-Node: file-length\7f2026693
-Node: file-position\7f2027735
-Node: file-string-length\7f2031602
-Node: open\7f2032383
-Node: stream-external-format\7f2042146
-Node: with-open-file\7f2043086
-Node: close\7f2046380
-Node: with-open-stream\7f2048547
-Node: listen\7f2049797
-Node: clear-input\7f2050918
-Node: finish-output\7f2052772
-Node: y-or-n-p\7f2054465
-Node: make-synonym-stream\7f2057114
-Node: synonym-stream-symbol\7f2058222
-Node: broadcast-stream-streams\7f2058747
-Node: make-broadcast-stream\7f2059293
-Node: make-two-way-stream\7f2060359
-Node: two-way-stream-input-stream\7f2061434
-Node: echo-stream-input-stream\7f2062285
-Node: make-echo-stream\7f2063051
-Node: concatenated-stream-streams\7f2064124
-Node: make-concatenated-stream\7f2064908
-Node: get-output-stream-string\7f2065811
-Node: make-string-input-stream\7f2067399
-Node: make-string-output-stream\7f2068566
-Node: with-input-from-string\7f2069693
-Node: with-output-to-string\7f2072253
-Node: *debug-io*\7f2074947
-Node: *terminal-io*\7f2079648
-Node: stream-error\7f2081164
-Node: stream-error-stream\7f2081813
-Node: end-of-file\7f2082558
-Node: Printer\7f2083048
-Node: The Lisp Printer\7f2083249
-Node: Overview of The Lisp Printer\7f2083532
-Node: Multiple Possible Textual Representations\7f2084234
-Node: Printer Escaping\7f2086358
-Node: Printer Dispatching\7f2087282
-Node: Default Print-Object Methods\7f2087848
-Node: Printing Numbers\7f2088759
-Node: Printing Integers\7f2088953
-Node: Printing Ratios\7f2089686
-Node: Printing Floats\7f2090436
-Node: Printing Complexes\7f2092071
-Node: Note about Printing Numbers\7f2092571
-Node: Printing Characters\7f2092919
-Node: Printing Symbols\7f2093858
-Node: Package Prefixes for Symbols\7f2095381
-Node: Effect of Readtable Case on the Lisp Printer\7f2097274
-Node: Examples of Effect of Readtable Case on the Lisp Printer\7f2099127
-Node: Printing Strings\7f2102858
-Node: Printing Lists and Conses\7f2103489
-Node: Printing Bit Vectors\7f2105935
-Node: Printing Other Vectors\7f2106584
-Node: Printing Other Arrays\7f2108082
-Node: Examples of Printing Arrays\7f2110343
-Node: Printing Random States\7f2111067
-Node: Printing Pathnames\7f2111952
-Node: Printing Structures\7f2112539
-Node: Printing Other Objects\7f2113481
-Node: Examples of Printer Behavior\7f2114357
-Node: The Lisp Pretty Printer\7f2115868
-Node: Pretty Printer Concepts\7f2116168
-Node: Dynamic Control of the Arrangement of Output\7f2117782
-Node: Format Directive Interface\7f2120823
-Node: Compiling Format Strings\7f2122073
-Node: Pretty Print Dispatch Tables\7f2122706
-Node: Pretty Printer Margins\7f2124310
-Node: Examples of using the Pretty Printer\7f2124807
-Node: Notes about the Pretty Printer`s Background\7f2136508
-Node: Formatted Output\7f2137029
-Node: FORMAT Basic Output\7f2141681
-Node: Tilde C-> Character\7f2142008
-Node: Tilde Percent-> Newline\7f2143820
-Node: Tilde Ampersand-> Fresh-Line\7f2144174
-Node: Tilde Vertical-Bar-> Page\7f2144584
-Node: Tilde Tilde-> Tilde\7f2144875
-Node: FORMAT Radix Control\7f2145084
-Node: Tilde R-> Radix\7f2145397
-Node: Tilde D-> Decimal\7f2146667
-Node: Tilde B-> Binary\7f2147982
-Node: Tilde O-> Octal\7f2148419
-Node: Tilde X-> Hexadecimal\7f2148857
-Node: FORMAT Floating-Point Printers\7f2149290
-Node: Tilde F-> Fixed-Format Floating-Point\7f2149687
-Node: Tilde E-> Exponential Floating-Point\7f2153778
-Node: Tilde G-> General Floating-Point\7f2158895
-Node: Tilde Dollarsign-> Monetary Floating-Point\7f2160262
-Node: FORMAT Printer Operations\7f2162528
-Node: Tilde A-> Aesthetic\7f2162827
-Node: Tilde S-> Standard\7f2164066
-Node: Tilde W-> Write\7f2164493
-Node: FORMAT Pretty Printer Operations\7f2165301
-Node: Tilde Underscore-> Conditional Newline\7f2165739
-Node: Tilde Less-Than-Sign-> Logical Block\7f2166231
-Node: Tilde I-> Indent\7f2169749
-Node: Tilde Slash-> Call Function\7f2170115
-Node: FORMAT Layout Control\7f2171975
-Node: Tilde T-> Tabulate\7f2172310
-Node: Tilde Less-Than-Sign-> Justification\7f2174535
-Node: Tilde Greater-Than-Sign-> End of Justification\7f2177951
-Node: FORMAT Control-Flow Operations\7f2178284
-Node: Tilde Asterisk-> Go-To\7f2178773
-Node: Tilde Left-Bracket-> Conditional Expression\7f2179666
-Node: Tilde Right-Bracket-> End of Conditional Expression\7f2182176
-Node: Tilde Left-Brace-> Iteration\7f2182577
-Node: Tilde Right-Brace-> End of Iteration\7f2185861
-Node: Tilde Question-Mark-> Recursive Processing\7f2186216
-Node: FORMAT Miscellaneous Operations\7f2187573
-Node: Tilde Left-Paren-> Case Conversion\7f2187936
-Node: Tilde Right-Paren-> End of Case Conversion\7f2189225
-Node: Tilde P-> Plural\7f2189579
-Node: FORMAT Miscellaneous Pseudo-Operations\7f2190361
-Node: Tilde Semicolon-> Clause Separator\7f2190759
-Node: Tilde Circumflex-> Escape Upward\7f2191144
-Node: Tilde Newline-> Ignored Newline\7f2194588
-Node: Additional Information about FORMAT Operations\7f2196000
-Node: Nesting of FORMAT Operations\7f2196444
-Node: Missing and Additional FORMAT Arguments\7f2197835
-Node: Additional FORMAT Parameters\7f2198328
-Node: Undefined FORMAT Modifier Combinations\7f2198729
-Node: Examples of FORMAT\7f2199140
-Node: Notes about FORMAT\7f2203164
-Node: Printer Dictionary\7f2203806
-Node: copy-pprint-dispatch\7f2204575
-Node: formatter\7f2205320
-Node: pprint-dispatch\7f2206517
-Node: pprint-exit-if-list-exhausted\7f2208053
-Node: pprint-fill\7f2209651
-Node: pprint-indent\7f2213094
-Node: pprint-logical-block\7f2214955
-Node: pprint-newline\7f2220449
-Node: pprint-pop\7f2224793
-Node: pprint-tab\7f2228009
-Node: print-object\7f2229399
-Node: print-unreadable-object\7f2234169
-Node: set-pprint-dispatch\7f2235994
-Node: write\7f2238185
-Node: write-to-string\7f2242257
-Node: *print-array*\7f2244469
-Node: *print-base*\7f2245317
-Node: *print-case*\7f2247630
-Node: *print-circle*\7f2249989
-Node: *print-escape*\7f2251610
-Node: *print-gensym*\7f2252751
-Node: *print-level*\7f2253402
-Node: *print-lines*\7f2256487
-Node: *print-miser-width*\7f2257874
-Node: *print-pprint-dispatch*\7f2258420
-Node: *print-pretty*\7f2259730
-Node: *print-readably*\7f2261644
-Node: *print-right-margin*\7f2265421
-Node: print-not-readable\7f2266299
-Node: print-not-readable-object\7f2267145
-Node: format\7f2267721
-Node: Reader\7f2269485
-Node: Reader Concepts\7f2269645
-Node: Dynamic Control of the Lisp Reader\7f2269931
-Node: Effect of Readtable Case on the Lisp Reader\7f2270317
-Node: Examples of Effect of Readtable Case on the Lisp Reader\7f2271362
-Node: Argument Conventions of Some Reader Functions\7f2272883
-Node: The EOF-ERROR-P argument\7f2273204
-Node: The RECURSIVE-P argument\7f2274833
-Node: Reader Dictionary\7f2277604
-Node: readtable\7f2278124
-Node: copy-readtable\7f2278933
-Node: make-dispatch-macro-character\7f2280840
-Node: read\7f2282101
-Node: read-delimited-list\7f2287318
-Node: read-from-string\7f2291029
-Node: readtable-case\7f2293509
-Node: readtablep\7f2294711
-Node: set-dispatch-macro-character\7f2295384
-Node: set-macro-character\7f2298467
-Node: set-syntax-from-char\7f2301037
-Node: with-standard-io-syntax\7f2303156
-Node: *read-base*\7f2305176
-Node: *read-default-float-format*\7f2306531
-Node: *read-eval*\7f2308076
-Node: *read-suppress*\7f2308786
-Node: *readtable*\7f2312435
-Node: reader-error\7f2313495
-Node: System Construction\7f2314029
-Node: System Construction Concepts\7f2314245
-Node: Loading\7f2314497
-Node: Features\7f2315454
-Node: Feature Expressions\7f2315963
-Node: Examples of Feature Expressions\7f2316986
-Node: System Construction Dictionary\7f2318577
-Node: compile-file\7f2318984
-Node: compile-file-pathname\7f2323747
-Node: load\7f2325797
-Node: with-compilation-unit\7f2331390
-Node: *features*\7f2333616
-Node: *compile-file-pathname*\7f2339053
-Node: *load-pathname*\7f2340365
-Node: *compile-print*\7f2341587
-Node: *load-print*\7f2342189
-Node: *modules*\7f2342827
-Node: provide\7f2343385
-Node: Environment\7f2346236
-Node: The External Environment\7f2346437
-Node: Top level loop\7f2346704
-Node: Debugging Utilities\7f2347560
-Node: Environment Inquiry\7f2348056
-Node: Time\7f2348746
-Node: Decoded Time\7f2349986
-Node: Universal Time\7f2351555
-Node: Internal Time\7f2352611
-Node: Seconds\7f2353192
-Node: Environment Dictionary\7f2353737
-Node: decode-universal-time\7f2354443
-Node: encode-universal-time\7f2356390
-Node: get-universal-time\7f2357560
-Node: sleep\7f2359710
-Node: apropos\7f2360797
-Node: describe\7f2362343
-Node: describe-object\7f2364191
-Node: trace\7f2367094
-Node: step\7f2369975
-Node: time\7f2371307
-Node: internal-time-units-per-second\7f2373187
-Node: get-internal-real-time\7f2373799
-Node: get-internal-run-time\7f2374654
-Node: disassemble\7f2375992
-Node: documentation\7f2377376
-Node: room\7f2383694
-Node: ed\7f2384792
-Node: inspect\7f2386255
-Node: dribble\7f2387151
-Node: - (Variable)\7f2389031
-Node: + (Variable)\7f2389674
-Node: * (Variable)\7f2390745
-Node: / (Variable)\7f2392292
-Node: lisp-implementation-type\7f2393438
-Node: short-site-name\7f2394670
-Node: machine-instance\7f2395633
-Node: machine-type\7f2396440
-Node: machine-version\7f2397102
-Node: software-type\7f2397814
-Node: user-homedir-pathname\7f2398832
-Node: Glossary (Glossary)\7f2400458
-Node: Glossary\7f2400599
-Node: Appendix\7f2561441
-Node: Removed Language Features\7f2561579
-Node: Requirements for removed and deprecated features\7f2561942
-Node: Removed Types\7f2563145
-Node: Removed Operators\7f2563378
-Node: Removed Argument Conventions\7f2563757
-Node: Removed Variables\7f2564075
-Node: Removed Reader Syntax\7f2564439
-Node: Packages No Longer Required\7f2564695
+Node: Introduction (Introduction)\7f41175
+Node: Scope\7f41527
+Node: Scope and Purpose\7f41775
+Node: History\7f42218
+Node: Organization of the Document\7f51790
+Node: Referenced Publications\7f54045
+Node: Definitions\7f57704
+Node: Notational Conventions\7f58096
+Node: Font Key\7f58725
+Node: Modified BNF Syntax\7f60566
+Node: Splicing in Modified BNF Syntax\7f60941
+Node: Indirection in Modified BNF Syntax\7f63437
+Node: Additional Uses for Indirect Definitions in Modified BNF Syntax\7f64085
+Node: Special Symbols\7f65269
+Node: Objects with Multiple Notations\7f70066
+Node: Case in Symbols\7f70510
+Node: Numbers (Objects with Multiple Notations)\7f71680
+Node: Use of the Dot Character\7f72080
+Node: NIL\7f73022
+Node: Designators\7f75079
+Node: Nonsense Words\7f77490
+Node: Error Terminology\7f78169
+Node: Sections Not Formally Part Of This Standard\7f85492
+Node: Interpreting Dictionary Entries\7f87002
+Node: The "Affected By" Section of a Dictionary Entry\7f89401
+Node: The "Arguments" Section of a Dictionary Entry\7f89934
+Node: The "Arguments and Values" Section of a Dictionary Entry\7f90456
+Node: The "Binding Types Affected" Section of a Dictionary Entry\7f91219
+Node: The "Class Precedence List" Section of a Dictionary Entry\7f91907
+Node: Dictionary Entries for Type Specifiers\7f93083
+Node: The "Compound Type Specifier Kind" Section of a Dictionary Entry\7f94225
+Node: The "Compound Type Specifier Syntax" Section of a Dictionary Entry\7f95276
+Node: The "Compound Type Specifier Arguments" Section of a Dictionary Entry\7f95952
+Node: The "Compound Type Specifier Description" Section of a Dictionary Entry\7f96519
+Node: The "Constant Value" Section of a Dictionary Entry\7f97070
+Node: The "Description" Section of a Dictionary Entry\7f97524
+Node: The "Examples" Section of a Dictionary Entry\7f98049
+Node: The "Exceptional Situations" Section of a Dictionary Entry\7f98538
+Node: The "Initial Value" Section of a Dictionary Entry\7f99379
+Node: The "Argument Precedence Order" Section of a Dictionary Entry\7f99903
+Node: The "Method Signature" Section of a Dictionary Entry\7f100431
+Node: The "Name" Section of a Dictionary Entry\7f101967
+Node: The "Notes" Section of a Dictionary Entry\7f104027
+Node: The "Pronunciation" Section of a Dictionary Entry\7f104737
+Node: The "See Also" Section of a Dictionary Entry\7f105552
+Node: The "Side Effects" Section of a Dictionary Entry\7f106027
+Node: The "Supertypes" Section of a Dictionary Entry\7f106459
+Node: The "Syntax" Section of a Dictionary Entry\7f107096
+Node: Special "Syntax" Notations for Overloaded Operators\7f108285
+Node: Naming Conventions for Rest Parameters\7f109438
+Node: Requiring Non-Null Rest Parameters in The "Syntax" Section\7f110297
+Node: Return values in The "Syntax" Section\7f111197
+Node: No Arguments or Values in The "Syntax" Section\7f111887
+Node: Unconditional Transfer of Control in The "Syntax" Section\7f112488
+Node: The "Valid Context" Section of a Dictionary Entry\7f113058
+Node: The "Value Type" Section of a Dictionary Entry\7f113699
+Node: Conformance\7f114054
+Node: Conforming Implementations\7f114470
+Node: Required Language Features\7f115075
+Node: Documentation of Implementation-Dependent Features\7f115704
+Node: Documentation of Extensions\7f116431
+Node: Treatment of Exceptional Situations\7f117074
+Node: Resolution of Apparent Conflicts in Exceptional Situations\7f117473
+Node: Examples of Resolution of Apparent Conflict in Exceptional Situations\7f118143
+Node: Conformance Statement\7f119147
+Node: Conforming Programs\7f120130
+Node: Use of Implementation-Defined Language Features\7f121091
+Node: Use of Read-Time Conditionals\7f122307
+Node: Language Extensions\7f123458
+Node: Language Subsets\7f125871
+Node: Deprecated Language Features\7f126588
+Node: Deprecated Functions\7f127429
+Node: Deprecated Argument Conventions\7f127987
+Node: Deprecated Variables\7f128996
+Node: Deprecated Reader Syntax\7f129245
+Node: Symbols in the COMMON-LISP Package\7f129716
+Node: Syntax\7f152216
+Node: Character Syntax\7f152460
+Node: Readtables\7f153213
+Node: The Current Readtable\7f154046
+Node: The Standard Readtable\7f154631
+Node: The Initial Readtable\7f155168
+Node: Variables that affect the Lisp Reader\7f155623
+Node: Standard Characters\7f156176
+Node: Character Syntax Types\7f160623
+Node: Constituent Characters\7f164557
+Node: Constituent Traits\7f165172
+Node: Invalid Characters\7f168716
+Node: Macro Characters\7f169264
+Node: Multiple Escape Characters\7f172038
+Node: Examples of Multiple Escape Characters\7f172693
+Node: Single Escape Character\7f173198
+Node: Examples of Single Escape Characters\7f173693
+Node: Whitespace Characters\7f174187
+Node: Examples of Whitespace Characters\7f174536
+Node: Reader Algorithm\7f174902
+Node: Interpretation of Tokens\7f181408
+Node: Numbers as Tokens\7f181768
+Node: Potential Numbers as Tokens\7f182872
+Node: Escape Characters and Potential Numbers\7f185462
+Node: Examples of Potential Numbers\7f186227
+Node: Constructing Numbers from Tokens\7f187350
+Node: Syntax of a Rational\7f188151
+Node: Syntax of an Integer\7f188366
+Node: Syntax of a Ratio\7f188957
+Node: Syntax of a Float\7f190086
+Node: Syntax of a Complex\7f192583
+Node: The Consing Dot\7f193639
+Node: Symbols as Tokens\7f194163
+Node: Valid Patterns for Tokens\7f197656
+Node: Package System Consistency Rules\7f200995
+Node: Standard Macro Characters\7f202656
+Node: Left-Parenthesis\7f203428
+Node: Right-Parenthesis\7f204958
+Node: Single-Quote\7f205285
+Node: Examples of Single-Quote\7f205743
+Node: Semicolon\7f205980
+Node: Examples of Semicolon\7f206544
+Node: Notes about Style for Semicolon\7f206771
+Node: Use of Single Semicolon\7f207188
+Node: Use of Double Semicolon\7f207779
+Node: Use of Triple Semicolon\7f208277
+Node: Use of Quadruple Semicolon\7f208657
+Node: Examples of Style for Semicolon\7f209167
+Node: Double-Quote\7f210140
+Node: Backquote\7f211585
+Node: Notes about Backquote\7f215509
+Node: Comma\7f216580
+Node: Sharpsign\7f216871
+Node: Sharpsign Backslash\7f221424
+Node: Sharpsign Single-Quote\7f222587
+Node: Sharpsign Left-Parenthesis\7f223060
+Node: Sharpsign Asterisk\7f224580
+Node: Examples of Sharpsign Asterisk\7f225844
+Node: Sharpsign Colon\7f226262
+Node: Sharpsign Dot\7f226778
+Node: Sharpsign B\7f227456
+Node: Sharpsign O\7f227847
+Node: Sharpsign X\7f228254
+Node: Sharpsign R\7f228760
+Node: Sharpsign C\7f230054
+Node: Sharpsign A\7f231132
+Node: Sharpsign S\7f232329
+Node: Sharpsign P\7f233436
+Node: Sharpsign Equal-Sign\7f233853
+Node: Sharpsign Sharpsign\7f234374
+Node: Sharpsign Plus\7f235443
+Node: Sharpsign Minus\7f236485
+Node: Sharpsign Vertical-Bar\7f236845
+Node: Examples of Sharpsign Vertical-Bar\7f237212
+Node: Notes about Style for Sharpsign Vertical-Bar\7f240203
+Node: Sharpsign Less-Than-Sign\7f241173
+Node: Sharpsign Whitespace\7f241611
+Node: Sharpsign Right-Parenthesis\7f241998
+Node: Re-Reading Abbreviated Expressions\7f242298
+Node: Evaluation and Compilation\7f242791
+Node: Evaluation\7f243172
+Node: Introduction to Environments\7f244460
+Node: The Global Environment\7f245318
+Node: Dynamic Environments\7f245969
+Node: Lexical Environments\7f247128
+Node: The Null Lexical Environment\7f248353
+Node: Environment Objects\7f248867
+Node: The Evaluation Model\7f249834
+Node: Form Evaluation\7f250529
+Node: Symbols as Forms\7f250832
+Node: Lexical Variables\7f252879
+Node: Dynamic Variables\7f253910
+Node: Constant Variables\7f255655
+Node: Symbols Naming Both Lexical and Dynamic Variables\7f256371
+Node: Conses as Forms\7f257223
+Node: Special Forms\7f258170
+Node: Macro Forms\7f259683
+Node: Function Forms\7f261508
+Node: Lambda Forms\7f263957
+Node: Self-Evaluating Objects\7f264615
+Node: Examples of Self-Evaluating Objects\7f265337
+Node: Lambda Expressions\7f265798
+Node: Closures and Lexical Binding\7f266437
+Node: Shadowing\7f270193
+Node: Extent\7f273365
+Node: Return Values\7f275631
+Node: Compilation\7f276972
+Node: Compiler Terminology\7f277279
+Node: Compilation Semantics\7f281572
+Node: Compiler Macros\7f282255
+Node: Purpose of Compiler Macros\7f283915
+Node: Naming of Compiler Macros\7f285630
+Node: When Compiler Macros Are Used\7f286608
+Node: Notes about the Implementation of Compiler Macros\7f288249
+Node: Minimal Compilation\7f289366
+Node: Semantic Constraints\7f290542
+Node: File Compilation\7f294196
+Node: Processing of Top Level Forms\7f296169
+Node: Processing of Defining Macros\7f300631
+Node: Constraints on Macros and Compiler Macros\7f303137
+Node: Literal Objects in Compiled Files\7f303937
+Node: Externalizable Objects\7f305347
+Node: Similarity of Literal Objects\7f306975
+Node: Similarity of Aggregate Objects\7f307219
+Node: Definition of Similarity\7f307803
+Node: Extensions to Similarity Rules\7f312671
+Node: Additional Constraints on Externalizable Objects\7f313547
+Node: Exceptional Situations in the Compiler\7f318284
+Node: Declarations\7f320383
+Node: Minimal Declaration Processing Requirements\7f321170
+Node: Declaration Specifiers\7f322336
+Node: Declaration Identifiers\7f322838
+Node: Shorthand notation for Type Declarations\7f323653
+Node: Declaration Scope\7f324020
+Node: Examples of Declaration Scope\7f325993
+Node: Lambda Lists\7f329193
+Node: Ordinary Lambda Lists\7f331623
+Node: Specifiers for the required parameters\7f334087
+Node: Specifiers for optional parameters\7f334937
+Node: A specifier for a rest parameter\7f336118
+Node: Specifiers for keyword parameters\7f337123
+Node: Suppressing Keyword Argument Checking\7f341146
+Node: Examples of Suppressing Keyword Argument Checking\7f341837
+Node: Specifiers for &aux variables\7f343079
+Node: Examples of Ordinary Lambda Lists\7f343930
+Node: Generic Function Lambda Lists\7f347871
+Node: Specialized Lambda Lists\7f349198
+Node: Macro Lambda Lists\7f350503
+Node: Destructuring by Lambda Lists\7f355787
+Node: Data-directed Destructuring by Lambda Lists\7f356978
+Node: Examples of Data-directed Destructuring by Lambda Lists\7f357525
+Node: Lambda-list-directed Destructuring by Lambda Lists\7f358238
+Node: Destructuring Lambda Lists\7f361299
+Node: Boa Lambda Lists\7f362531
+Node: Defsetf Lambda Lists\7f366409
+Node: Deftype Lambda Lists\7f367323
+Node: Define-modify-macro Lambda Lists\7f367941
+Node: Define-method-combination Arguments Lambda Lists\7f368808
+Node: Syntactic Interaction of Documentation Strings and Declarations\7f369653
+Node: Error Checking in Function Calls\7f370404
+Node: Argument Mismatch Detection\7f370675
+Node: Safe and Unsafe Calls\7f371164
+Node: Error Detection Time in Safe Calls\7f373927
+Node: Too Few Arguments\7f374510
+Node: Too Many Arguments\7f375035
+Node: Unrecognized Keyword Arguments\7f375683
+Node: Invalid Keyword Arguments\7f376303
+Node: Odd Number of Keyword Arguments\7f376907
+Node: Destructuring Mismatch\7f377493
+Node: Errors When Calling a Next Method\7f378030
+Node: Traversal Rules and Side Effects\7f379005
+Node: Destructive Operations\7f380251
+Node: Modification of Literal Objects\7f380576
+Node: Transfer of Control during a Destructive Operation\7f382974
+Node: Examples of Transfer of Control during a Destructive Operation\7f383471
+Node: Evaluation and Compilation Dictionary\7f384353
+Node: lambda (Symbol)\7f385036
+Node: lambda\7f386238
+Node: compile\7f387360
+Node: eval\7f390581
+Node: eval-when\7f392523
+Node: load-time-value\7f398966
+Node: quote\7f404784
+Node: compiler-macro-function\7f406368
+Node: define-compiler-macro\7f407339
+Node: defmacro\7f414831
+Node: macro-function\7f421014
+Node: macroexpand\7f423270
+Node: define-symbol-macro\7f428337
+Node: symbol-macrolet\7f430903
+Node: *macroexpand-hook*\7f434034
+Node: proclaim\7f436300
+Node: declaim\7f438423
+Node: declare\7f439236
+Node: ignore\7f443268
+Node: dynamic-extent\7f445305
+Node: type\7f451698
+Node: inline\7f458475
+Node: ftype\7f462301
+Node: declaration\7f463835
+Node: optimize\7f464763
+Node: special\7f466919
+Node: locally\7f471407
+Node: the\7f473583
+Node: special-operator-p\7f475991
+Node: constantp\7f476912
+Node: Types and Classes\7f479952
+Node: Introduction (Types and Classes)\7f480214
+Node: Types\7f482372
+Node: Data Type Definition\7f482584
+Node: Type Relationships\7f483704
+Node: Type Specifiers\7f485629
+Node: Classes\7f493865
+Node: Introduction to Classes\7f494726
+Node: Standard Metaclasses\7f499454
+Node: Defining Classes\7f500413
+Node: Creating Instances of Classes\7f502085
+Node: Inheritance\7f502876
+Node: Examples of Inheritance\7f503340
+Node: Inheritance of Class Options\7f504317
+Node: Determining the Class Precedence List\7f505137
+Node: Topological Sorting\7f507197
+Node: Examples of Class Precedence List Determination\7f509630
+Node: Redefining Classes\7f513184
+Node: Modifying the Structure of Instances\7f516288
+Node: Initializing Newly Added Local Slots (Redefining Classes)\7f517473
+Node: Customizing Class Redefinition\7f519374
+Node: Integrating Types and Classes\7f520453
+Node: Types and Classes Dictionary\7f526717
+Node: nil (Type)\7f527486
+Node: boolean\7f527942
+Node: function (System Class)\7f528742
+Node: compiled-function\7f533458
+Node: generic-function\7f534297
+Node: standard-generic-function\7f535334
+Node: class\7f535857
+Node: built-in-class\7f536393
+Node: structure-class\7f537319
+Node: standard-class\7f537734
+Node: method\7f538132
+Node: standard-method\7f539271
+Node: structure-object\7f539702
+Node: standard-object\7f540301
+Node: method-combination\7f540739
+Node: t (System Class)\7f541398
+Node: satisfies\7f541764
+Node: member (Type Specifier)\7f542937
+Node: not (Type Specifier)\7f543952
+Node: and (Type Specifier)\7f544668
+Node: or (Type Specifier)\7f545506
+Node: values (Type Specifier)\7f546537
+Node: eql (Type Specifier)\7f547804
+Node: coerce\7f548579
+Node: deftype\7f553241
+Node: subtypep\7f556394
+Node: type-of\7f563359
+Node: typep\7f566275
+Node: type-error\7f569683
+Node: type-error-datum\7f570386
+Node: simple-type-error\7f571732
+Node: Data and Control Flow\7f572476
+Node: Generalized Reference\7f572741
+Node: Overview of Places and Generalized Reference\7f573068
+Node: Evaluation of Subforms to Places\7f575385
+Node: Examples of Evaluation of Subforms to Places\7f577890
+Node: Setf Expansions\7f578616
+Node: Examples of Setf Expansions\7f580686
+Node: Kinds of Places\7f582567
+Node: Variable Names as Places\7f583205
+Node: Function Call Forms as Places\7f583483
+Node: VALUES Forms as Places\7f591603
+Node: THE Forms as Places\7f592741
+Node: APPLY Forms as Places\7f593200
+Node: Setf Expansions and Places\7f594569
+Node: Macro Forms as Places\7f594989
+Node: Symbol Macros as Places\7f595523
+Node: Other Compound Forms as Places\7f595902
+Node: Treatment of Other Macros Based on SETF\7f596933
+Node: Transfer of Control to an Exit Point\7f598349
+Node: Data and Control Flow Dictionary\7f600484
+Node: apply\7f601718
+Node: defun\7f603751
+Node: fdefinition\7f607498
+Node: fboundp\7f609345
+Node: fmakunbound\7f611158
+Node: flet\7f612143
+Node: funcall\7f620017
+Node: function (Special Operator)\7f621726
+Node: function-lambda-expression\7f623809
+Node: functionp\7f627057
+Node: compiled-function-p\7f628015
+Node: call-arguments-limit\7f629162
+Node: lambda-list-keywords\7f629795
+Node: lambda-parameters-limit\7f630538
+Node: defconstant\7f631189
+Node: defparameter\7f634035
+Node: destructuring-bind\7f640614
+Node: let\7f641937
+Node: progv\7f645256
+Node: setq\7f646765
+Node: psetq\7f648453
+Node: block\7f650443
+Node: catch\7f652255
+Node: go\7f654948
+Node: return-from\7f656390
+Node: return\7f658674
+Node: tagbody\7f659667
+Node: throw\7f662078
+Node: unwind-protect\7f664746
+Node: nil\7f669983
+Node: not\7f670378
+Node: t\7f671228
+Node: eq\7f672215
+Node: eql\7f674637
+Node: equal\7f677618
+Node: equalp\7f681224
+Node: identity\7f685165
+Node: complement\7f685924
+Node: constantly\7f687628
+Node: every\7f688602
+Node: and\7f691597
+Node: cond\7f693357
+Node: if\7f695002
+Node: or\7f696259
+Node: when\7f697675
+Node: case\7f700275
+Node: typecase\7f705384
+Node: multiple-value-bind\7f710964
+Node: multiple-value-call\7f712831
+Node: multiple-value-list\7f714087
+Node: multiple-value-prog1\7f714908
+Node: multiple-value-setq\7f715865
+Node: values\7f717479
+Node: values-list\7f719415
+Node: multiple-values-limit\7f720397
+Node: nth-value\7f721223
+Node: prog\7f722516
+Node: prog1\7f726268
+Node: progn\7f728427
+Node: define-modify-macro\7f729814
+Node: defsetf\7f732298
+Node: define-setf-expander\7f738441
+Node: get-setf-expansion\7f743277
+Node: setf\7f745030
+Node: shiftf\7f747494
+Node: rotatef\7f750101
+Node: control-error\7f751822
+Node: program-error\7f752443
+Node: undefined-function\7f752989
+Node: Iteration\7f753594
+Node: The LOOP Facility\7f753768
+Node: Overview of the Loop Facility\7f754234
+Node: Simple vs Extended Loop\7f755015
+Node: Simple Loop\7f755316
+Node: Extended Loop\7f756009
+Node: Loop Keywords\7f756640
+Node: Parsing Loop Clauses\7f757574
+Node: Expanding Loop Forms\7f759197
+Node: Summary of Loop Clauses\7f761894
+Node: Summary of Variable Initialization and Stepping Clauses\7f762195
+Node: Summary of Value Accumulation Clauses\7f763028
+Node: Summary of Termination Test Clauses\7f764818
+Node: Summary of Unconditional Execution Clauses\7f766525
+Node: Summary of Conditional Execution Clauses\7f767245
+Node: Summary of Miscellaneous Clauses\7f768337
+Node: Order of Execution\7f769030
+Node: Destructuring\7f770902
+Node: Restrictions on Side-Effects\7f775322
+Node: Variable Initialization and Stepping Clauses\7f775559
+Node: Iteration Control\7f776411
+Node: The for-as-arithmetic subclause\7f779325
+Node: Examples of for-as-arithmetic subclause\7f783173
+Node: The for-as-in-list subclause\7f783926
+Node: Examples of for-as-in-list subclause\7f784720
+Node: The for-as-on-list subclause\7f785509
+Node: Examples of for-as-on-list subclause\7f786262
+Node: The for-as-equals-then subclause\7f786882
+Node: Examples of for-as-equals-then subclause\7f787640
+Node: The for-as-across subclause\7f788097
+Node: Examples of for-as-across subclause\7f788799
+Node: The for-as-hash subclause\7f789186
+Node: The for-as-package subclause\7f791408
+Node: Examples of for-as-package subclause\7f793972
+Node: Local Variable Initializations\7f794593
+Node: Examples of WITH clause\7f797436
+Node: Value Accumulation Clauses\7f798478
+Node: Examples of COLLECT clause\7f804315
+Node: Examples of APPEND and NCONC clauses\7f805068
+Node: Examples of COUNT clause\7f805689
+Node: Examples of MAXIMIZE and MINIMIZE clauses\7f806011
+Node: Examples of SUM clause\7f806882
+Node: Termination Test Clauses\7f807288
+Node: Examples of REPEAT clause\7f811458
+Node: Examples of ALWAYS\7f811985
+Node: Examples of WHILE and UNTIL clauses\7f814008
+Node: Unconditional Execution Clauses\7f814803
+Node: Examples of unconditional execution\7f815696
+Node: Conditional Execution Clauses\7f816192
+Node: Examples of WHEN clause\7f817897
+Node: Miscellaneous Clauses\7f819576
+Node: Control Transfer Clauses\7f819891
+Node: Examples of NAMED clause\7f820719
+Node: Initial and Final Execution\7f821110
+Node: Examples of Miscellaneous Loop Features\7f822739
+Node: Examples of clause grouping\7f823809
+Node: Notes about Loop\7f826256
+Node: Iteration Dictionary\7f827278
+Node: do\7f827483
+Node: dotimes\7f835924
+Node: dolist\7f839379
+Node: loop\7f841601
+Node: loop-finish\7f847061
+Node: Objects\7f849886
+Node: Object Creation and Initialization\7f850190
+Node: Initialization Arguments\7f854102
+Node: Declaring the Validity of Initialization Arguments\7f856709
+Node: Defaulting of Initialization Arguments\7f860208
+Node: Rules for Initialization Arguments\7f863479
+Node: Shared-Initialize\7f867330
+Node: Initialize-Instance\7f870012
+Node: Definitions of Make-Instance and Initialize-Instance\7f872747
+Node: Changing the Class of an Instance\7f874845
+Node: Modifying the Structure of the Instance\7f876097
+Node: Initializing Newly Added Local Slots (Changing the Class of an Instance)\7f877035
+Node: Customizing the Change of Class of an Instance\7f878772
+Node: Reinitializing an Instance\7f879575
+Node: Customizing Reinitialization\7f881038
+Node: Meta-Objects\7f881702
+Node: Standard Meta-objects\7f882228
+Node: Slots\7f883267
+Node: Introduction to Slots\7f883491
+Node: Accessing Slots\7f886129
+Node: Inheritance of Slots and Slot Options\7f888706
+Node: Generic Functions and Methods\7f893448
+Node: Introduction to Generic Functions\7f893943
+Node: Introduction to Methods\7f897445
+Node: Agreement on Parameter Specializers and Qualifiers\7f903907
+Node: Congruent Lambda-lists for all Methods of a Generic Function\7f904904
+Node: Keyword Arguments in Generic Functions and Methods\7f907046
+Node: Examples of Keyword Arguments in Generic Functions and Methods\7f908738
+Node: Method Selection and Combination\7f910077
+Node: Determining the Effective Method\7f911543
+Node: Selecting the Applicable Methods\7f912137
+Node: Sorting the Applicable Methods by Precedence Order\7f912478
+Node: Applying method combination to the sorted list of applicable methods\7f914543
+Node: Standard Method Combination\7f916710
+Node: Declarative Method Combination\7f921657
+Node: Built-in Method Combination Types\7f922568
+Node: Inheritance of Methods\7f926641
+Node: Objects Dictionary\7f927212
+Node: function-keywords\7f928220
+Node: ensure-generic-function\7f929847
+Node: allocate-instance\7f933155
+Node: reinitialize-instance\7f934682
+Node: shared-initialize\7f936917
+Node: update-instance-for-different-class\7f941425
+Node: update-instance-for-redefined-class\7f945563
+Node: change-class\7f950836
+Node: slot-boundp\7f954857
+Node: slot-exists-p\7f956639
+Node: slot-makunbound\7f957441
+Node: slot-missing\7f958979
+Node: slot-unbound\7f961318
+Node: slot-value\7f962990
+Node: method-qualifiers\7f965801
+Node: no-applicable-method\7f966598
+Node: no-next-method\7f967723
+Node: remove-method\7f968926
+Node: make-instance\7f969748
+Node: make-instances-obsolete\7f971163
+Node: make-load-form\7f972478
+Node: make-load-form-saving-slots\7f983995
+Node: with-accessors\7f985943
+Node: with-slots\7f988882
+Node: defclass\7f992251
+Node: defgeneric\7f1004461
+Node: defmethod\7f1015148
+Node: find-class\7f1022041
+Node: next-method-p\7f1024020
+Node: call-method\7f1025125
+Node: call-next-method\7f1028141
+Node: compute-applicable-methods\7f1031202
+Node: define-method-combination\7f1032264
+Node: find-method\7f1056016
+Node: add-method\7f1058673
+Node: initialize-instance\7f1059907
+Node: class-name\7f1061699
+Node: setf class-name\7f1062456
+Node: class-of\7f1063085
+Node: unbound-slot\7f1064089
+Node: unbound-slot-instance\7f1064757
+Node: Structures\7f1065325
+Node: Structures Dictionary\7f1065470
+Node: defstruct\7f1065650
+Node: copy-structure\7f1106426
+Node: Conditions\7f1107022
+Node: Condition System Concepts\7f1107197
+Node: Condition Types\7f1110806
+Node: Serious Conditions\7f1113222
+Node: Creating Conditions\7f1113603
+Node: Condition Designators\7f1114156
+Node: Printing Conditions\7f1115996
+Node: Recommended Style in Condition Reporting\7f1117339
+Node: Capitalization and Punctuation in Condition Reports\7f1118468
+Node: Leading and Trailing Newlines in Condition Reports\7f1119191
+Node: Embedded Newlines in Condition Reports\7f1120153
+Node: Note about Tabs in Condition Reports\7f1121326
+Node: Mentioning Containing Function in Condition Reports\7f1121951
+Node: Signaling and Handling Conditions\7f1122436
+Node: Signaling\7f1124701
+Node: Resignaling a Condition\7f1125890
+Node: Restarts\7f1126950
+Node: Interactive Use of Restarts\7f1129127
+Node: Interfaces to Restarts\7f1130323
+Node: Restart Tests\7f1131218
+Node: Associating a Restart with a Condition\7f1131698
+Node: Assertions\7f1132597
+Node: Notes about the Condition System`s Background\7f1133093
+Node: Conditions Dictionary\7f1133584
+Node: condition\7f1134599
+Node: warning\7f1136393
+Node: style-warning\7f1136750
+Node: serious-condition\7f1137954
+Node: error (Condition Type)\7f1139187
+Node: cell-error\7f1139552
+Node: cell-error-name\7f1140158
+Node: parse-error\7f1141153
+Node: storage-condition\7f1141623
+Node: assert\7f1143209
+Node: error\7f1147170
+Node: cerror\7f1150866
+Node: check-type\7f1155996
+Node: simple-error\7f1160285
+Node: invalid-method-error\7f1160784
+Node: method-combination-error\7f1162341
+Node: signal\7f1163471
+Node: simple-condition\7f1166032
+Node: simple-condition-format-control\7f1166961
+Node: warn\7f1168341
+Node: simple-warning\7f1170775
+Node: invoke-debugger\7f1171248
+Node: break\7f1172750
+Node: *debugger-hook*\7f1175191
+Node: *break-on-signals*\7f1177686
+Node: handler-bind\7f1180326
+Node: handler-case\7f1182917
+Node: ignore-errors\7f1188118
+Node: define-condition\7f1190012
+Node: make-condition\7f1201764
+Node: restart\7f1203073
+Node: compute-restarts\7f1203705
+Node: find-restart\7f1206469
+Node: invoke-restart\7f1208474
+Node: invoke-restart-interactively\7f1210215
+Node: restart-bind\7f1212534
+Node: restart-case\7f1216582
+Node: restart-name\7f1226400
+Node: with-condition-restarts\7f1227366
+Node: with-simple-restart\7f1228703
+Node: abort (Restart)\7f1232191
+Node: continue\7f1233185
+Node: muffle-warning\7f1234346
+Node: store-value\7f1235969
+Node: use-value\7f1237206
+Node: abort (Function)\7f1237843
+Node: Symbols\7f1244179
+Node: Symbol Concepts\7f1244335
+Node: Symbols Dictionary\7f1244920
+Node: symbol\7f1245350
+Node: keyword\7f1250363
+Node: symbolp\7f1250963
+Node: keywordp\7f1251717
+Node: make-symbol\7f1252601
+Node: copy-symbol\7f1254216
+Node: gensym\7f1256661
+Node: *gensym-counter*\7f1258973
+Node: gentemp\7f1259743
+Node: symbol-function\7f1262595
+Node: symbol-name\7f1265564
+Node: symbol-package\7f1266267
+Node: symbol-plist\7f1268124
+Node: symbol-value\7f1269340
+Node: get\7f1271355
+Node: remprop\7f1274615
+Node: boundp\7f1277243
+Node: makunbound\7f1278237
+Node: set\7f1279004
+Node: unbound-variable\7f1280748
+Node: Packages\7f1281319
+Node: Package Concepts\7f1281486
+Node: Introduction to Packages\7f1281699
+Node: Package Names and Nicknames\7f1283498
+Node: Symbols in a Package\7f1284269
+Node: Internal and External Symbols\7f1284482
+Node: Package Inheritance\7f1285397
+Node: Accessibility of Symbols in a Package\7f1286347
+Node: Locating a Symbol in a Package\7f1287960
+Node: Prevention of Name Conflicts in Packages\7f1288579
+Node: Standardized Packages\7f1291943
+Node: The COMMON-LISP Package\7f1292882
+Node: Constraints on the COMMON-LISP Package for Conforming Implementations\7f1294217
+Node: Constraints on the COMMON-LISP Package for Conforming Programs\7f1295763
+Node: Some Exceptions to Constraints on the COMMON-LISP Package for Conforming Programs\7f1297874
+Node: The COMMON-LISP-USER Package\7f1299721
+Node: The KEYWORD Package\7f1300320
+Node: Interning a Symbol in the KEYWORD Package\7f1301183
+Node: Notes about The KEYWORD Package\7f1301773
+Node: Implementation-Defined Packages\7f1302696
+Node: Packages Dictionary\7f1303265
+Node: package\7f1303937
+Node: export\7f1304390
+Node: find-symbol\7f1307472
+Node: find-package\7f1309901
+Node: find-all-symbols\7f1310927
+Node: import\7f1311923
+Node: list-all-packages\7f1314430
+Node: rename-package\7f1315104
+Node: shadow\7f1316392
+Node: shadowing-import\7f1318770
+Node: delete-package\7f1320702
+Node: make-package\7f1325721
+Node: with-package-iterator\7f1327773
+Node: unexport\7f1333420
+Node: unintern\7f1334980
+Node: in-package\7f1337075
+Node: unuse-package\7f1338048
+Node: use-package\7f1339465
+Node: defpackage\7f1341554
+Node: do-symbols\7f1349903
+Node: intern\7f1353485
+Node: package-name\7f1355830
+Node: package-nicknames\7f1356886
+Node: package-shadowing-symbols\7f1357665
+Node: package-use-list\7f1358897
+Node: package-used-by-list\7f1359795
+Node: packagep\7f1360669
+Node: *package*\7f1361322
+Node: package-error\7f1362695
+Node: package-error-package\7f1363354
+Node: Numbers (Numbers)\7f1364052
+Node: Number Concepts\7f1364218
+Node: Numeric Operations\7f1364596
+Node: Associativity and Commutativity in Numeric Operations\7f1366616
+Node: Examples of Associativity and Commutativity in Numeric Operations\7f1367739
+Node: Contagion in Numeric Operations\7f1369399
+Node: Viewing Integers as Bits and Bytes\7f1369916
+Node: Logical Operations on Integers\7f1370170
+Node: Byte Operations on Integers\7f1371250
+Node: Implementation-Dependent Numeric Constants\7f1372046
+Node: Rational Computations\7f1373233
+Node: Rule of Unbounded Rational Precision\7f1373645
+Node: Rule of Canonical Representation for Rationals\7f1374100
+Node: Rule of Float Substitutability\7f1375211
+Node: Floating-point Computations\7f1377613
+Node: Rule of Float and Rational Contagion\7f1378093
+Node: Examples of Rule of Float and Rational Contagion\7f1378990
+Node: Rule of Float Approximation\7f1380054
+Node: Rule of Float Underflow and Overflow\7f1381236
+Node: Rule of Float Precision Contagion\7f1381678
+Node: Complex Computations\7f1382029
+Node: Rule of Complex Substitutability\7f1382516
+Node: Rule of Complex Contagion\7f1382917
+Node: Rule of Canonical Representation for Complex Rationals\7f1383324
+Node: Examples of Rule of Canonical Representation for Complex Rationals\7f1384188
+Node: Principal Values and Branch Cuts\7f1384853
+Node: Interval Designators\7f1386887
+Node: Random-State Operations\7f1388402
+Node: Numbers Dictionary\7f1388752
+Node: number\7f1390123
+Node: complex (System Class)\7f1391285
+Node: real\7f1393529
+Node: float (System Class)\7f1394688
+Node: short-float\7f1397350
+Node: rational (System Class)\7f1401340
+Node: ratio\7f1402376
+Node: integer\7f1402975
+Node: signed-byte\7f1404347
+Node: unsigned-byte\7f1405384
+Node: mod (System Class)\7f1406514
+Node: bit (System Class)\7f1407260
+Node: fixnum\7f1407621
+Node: bignum\7f1408112
+Node: =\7f1408418
+Node: max\7f1411823
+Node: minusp\7f1413901
+Node: zerop\7f1414833
+Node: floor\7f1415820
+Node: sin\7f1420683
+Node: asin\7f1421514
+Node: pi\7f1428348
+Node: sinh\7f1429458
+Node: *\7f1434005
+Node: +\7f1434843
+Node: -\7f1435644
+Node: /\7f1436805
+Node: 1+\7f1438436
+Node: abs\7f1439402
+Node: evenp\7f1440849
+Node: exp\7f1441767
+Node: gcd\7f1444968
+Node: incf\7f1446004
+Node: lcm\7f1447200
+Node: log\7f1448318
+Node: mod (Function)\7f1450488
+Node: signum\7f1451810
+Node: sqrt\7f1453482
+Node: random-state\7f1455567
+Node: make-random-state\7f1456412
+Node: random\7f1458355
+Node: random-state-p\7f1459856
+Node: *random-state*\7f1460629
+Node: numberp\7f1462059
+Node: cis\7f1462734
+Node: complex\7f1463310
+Node: complexp\7f1464963
+Node: conjugate\7f1465617
+Node: phase\7f1466396
+Node: realpart\7f1467956
+Node: upgraded-complex-part-type\7f1468955
+Node: realp\7f1469939
+Node: numerator\7f1470572
+Node: rational (Function)\7f1471637
+Node: rationalp\7f1473201
+Node: ash\7f1473870
+Node: integer-length\7f1475377
+Node: integerp\7f1477041
+Node: parse-integer\7f1477691
+Node: boole\7f1479808
+Node: boole-1\7f1484328
+Node: logand\7f1485439
+Node: logbitp\7f1489419
+Node: logcount\7f1490614
+Node: logtest\7f1492033
+Node: byte\7f1493106
+Node: deposit-field\7f1494361
+Node: dpb\7f1495391
+Node: ldb\7f1496839
+Node: ldb-test\7f1498449
+Node: mask-field\7f1499290
+Node: most-positive-fixnum\7f1500948
+Node: decode-float\7f1501622
+Node: float\7f1507401
+Node: floatp\7f1508340
+Node: most-positive-short-float\7f1508974
+Node: short-float-epsilon\7f1513275
+Node: arithmetic-error\7f1514660
+Node: arithmetic-error-operands\7f1515414
+Node: division-by-zero\7f1516335
+Node: floating-point-invalid-operation\7f1516813
+Node: floating-point-inexact\7f1517601
+Node: floating-point-overflow\7f1518356
+Node: floating-point-underflow\7f1518865
+Node: Characters\7f1519348
+Node: Character Concepts\7f1519524
+Node: Introduction to Characters\7f1520018
+Node: Introduction to Scripts and Repertoires\7f1521423
+Node: Character Scripts\7f1521731
+Node: Character Repertoires\7f1522744
+Node: Character Attributes\7f1523655
+Node: Character Categories\7f1524663
+Node: Graphic Characters\7f1525886
+Node: Alphabetic Characters\7f1526813
+Node: Characters With Case\7f1527476
+Node: Uppercase Characters\7f1527930
+Node: Lowercase Characters\7f1528385
+Node: Corresponding Characters in the Other Case\7f1528859
+Node: Case of Implementation-Defined Characters\7f1529390
+Node: Numeric Characters\7f1529891
+Node: Alphanumeric Characters\7f1530399
+Node: Digits in a Radix\7f1530718
+Node: Identity of Characters\7f1531446
+Node: Ordering of Characters\7f1531716
+Node: Character Names\7f1533506
+Node: Treatment of Newline during Input and Output\7f1534649
+Node: Character Encodings\7f1535200
+Node: Documentation of Implementation-Defined Scripts\7f1535998
+Node: Characters Dictionary\7f1537469
+Node: character (System Class)\7f1537972
+Node: base-char\7f1538583
+Node: standard-char\7f1540567
+Node: extended-char\7f1541107
+Node: char=\7f1541568
+Node: character\7f1547732
+Node: characterp\7f1548611
+Node: alpha-char-p\7f1549549
+Node: alphanumericp\7f1550720
+Node: digit-char\7f1552115
+Node: digit-char-p\7f1553235
+Node: graphic-char-p\7f1554735
+Node: standard-char-p\7f1555621
+Node: char-upcase\7f1556469
+Node: upper-case-p\7f1558907
+Node: char-code\7f1560456
+Node: char-int\7f1561183
+Node: code-char\7f1562179
+Node: char-code-limit\7f1562941
+Node: char-name\7f1563601
+Node: name-char\7f1565525
+Node: Conses\7f1566403
+Node: Cons Concepts\7f1566551
+Node: Conses as Trees\7f1567087
+Node: General Restrictions on Parameters that must be Trees\7f1568055
+Node: Conses as Lists\7f1568489
+Node: Lists as Association Lists\7f1569888
+Node: Lists as Sets\7f1570415
+Node: General Restrictions on Parameters that must be Lists\7f1570965
+Node: Conses Dictionary\7f1571622
+Node: list (System Class)\7f1572384
+Node: null (System Class)\7f1573618
+Node: cons (System Class)\7f1574110
+Node: atom (Type)\7f1575340
+Node: cons\7f1575580
+Node: consp\7f1576497
+Node: atom\7f1577219
+Node: rplaca\7f1577926
+Node: car\7f1579066
+Node: copy-tree\7f1585451
+Node: sublis\7f1587080
+Node: subst\7f1590826
+Node: tree-equal\7f1595215
+Node: copy-list\7f1596998
+Node: list (Function)\7f1598320
+Node: list-length\7f1599948
+Node: listp\7f1601858
+Node: make-list\7f1602663
+Node: push\7f1603625
+Node: pop\7f1604871
+Node: first\7f1606170
+Node: nth\7f1609047
+Node: endp\7f1610106
+Node: null\7f1611507
+Node: nconc\7f1612317
+Node: append\7f1614458
+Node: revappend\7f1615592
+Node: butlast\7f1617783
+Node: last\7f1619619
+Node: ldiff\7f1621387
+Node: nthcdr\7f1625022
+Node: rest\7f1626157
+Node: member (Function)\7f1627141
+Node: mapc\7f1629444
+Node: acons\7f1633682
+Node: assoc\7f1634701
+Node: copy-alist\7f1637953
+Node: pairlis\7f1639231
+Node: rassoc\7f1640756
+Node: get-properties\7f1642890
+Node: getf\7f1644274
+Node: remf\7f1647145
+Node: intersection\7f1648500
+Node: adjoin\7f1652442
+Node: pushnew\7f1654388
+Node: set-difference\7f1657133
+Node: set-exclusive-or\7f1660510
+Node: subsetp\7f1663608
+Node: union\7f1665634
+Node: Arrays\7f1668735
+Node: Array Concepts\7f1668881
+Node: Array Elements\7f1669069
+Node: Array Indices\7f1669626
+Node: Array Dimensions\7f1670041
+Node: Implementation Limits on Individual Array Dimensions\7f1670631
+Node: Array Rank\7f1671056
+Node: Vectors\7f1671541
+Node: Fill Pointers\7f1671747
+Node: Multidimensional Arrays\7f1672479
+Node: Storage Layout for Multidimensional Arrays\7f1672690
+Node: Implementation Limits on Array Rank\7f1673204
+Node: Specialized Arrays\7f1673578
+Node: Array Upgrading\7f1674894
+Node: Required Kinds of Specialized Arrays\7f1676276
+Node: Arrays Dictionary\7f1677769
+Node: array\7f1678584
+Node: simple-array\7f1681636
+Node: vector (System Class)\7f1683589
+Node: simple-vector\7f1685689
+Node: bit-vector\7f1686702
+Node: simple-bit-vector\7f1687747
+Node: make-array\7f1688733
+Node: adjust-array\7f1697412
+Node: adjustable-array-p\7f1705423
+Node: aref\7f1706399
+Node: array-dimension\7f1708090
+Node: array-dimensions\7f1708957
+Node: array-element-type\7f1709811
+Node: array-has-fill-pointer-p\7f1711203
+Node: array-displacement\7f1712361
+Node: array-in-bounds-p\7f1714042
+Node: array-rank\7f1715223
+Node: array-row-major-index\7f1716001
+Node: array-total-size\7f1717525
+Node: arrayp\7f1718807
+Node: fill-pointer\7f1719570
+Node: row-major-aref\7f1720729
+Node: upgraded-array-element-type\7f1721827
+Node: array-dimension-limit\7f1723434
+Node: array-rank-limit\7f1723963
+Node: array-total-size-limit\7f1724457
+Node: simple-vector-p\7f1725225
+Node: svref\7f1725986
+Node: vector\7f1727060
+Node: vector-pop\7f1727966
+Node: vector-push\7f1729237
+Node: vectorp\7f1732069
+Node: bit (Array)\7f1732777
+Node: bit-and\7f1734123
+Node: bit-vector-p\7f1738320
+Node: simple-bit-vector-p\7f1739125
+Node: Strings\7f1739835
+Node: String Concepts\7f1739988
+Node: Implications of Strings Being Arrays\7f1740204
+Node: Subtypes of STRING\7f1740693
+Node: Strings Dictionary\7f1741100
+Node: string (System Class)\7f1741439
+Node: base-string\7f1742511
+Node: simple-string\7f1743461
+Node: simple-base-string\7f1744504
+Node: simple-string-p\7f1745418
+Node: char\7f1746179
+Node: string\7f1747726
+Node: string-upcase\7f1748993
+Node: string-trim\7f1753054
+Node: string=\7f1754701
+Node: stringp\7f1760241
+Node: make-string\7f1760862
+Node: Sequences\7f1761806
+Node: Sequence Concepts\7f1762003
+Node: General Restrictions on Parameters that must be Sequences\7f1763639
+Node: Rules about Test Functions\7f1764024
+Node: Satisfying a Two-Argument Test\7f1764293
+Node: Examples of Satisfying a Two-Argument Test\7f1766749
+Node: Satisfying a One-Argument Test\7f1768051
+Node: Examples of Satisfying a One-Argument Test\7f1769922
+Node: Sequences Dictionary\7f1770519
+Node: sequence\7f1770958
+Node: copy-seq\7f1771665
+Node: elt\7f1772826
+Node: fill\7f1773912
+Node: make-sequence\7f1775311
+Node: subseq\7f1777425
+Node: map\7f1779522
+Node: map-into\7f1782389
+Node: reduce\7f1785277
+Node: count\7f1788589
+Node: length\7f1790685
+Node: reverse\7f1791676
+Node: sort\7f1793824
+Node: find\7f1799277
+Node: position\7f1801845
+Node: search\7f1804006
+Node: mismatch\7f1805939
+Node: replace\7f1808251
+Node: substitute\7f1810566
+Node: concatenate\7f1816520
+Node: merge\7f1818698
+Node: remove\7f1822848
+Node: remove-duplicates\7f1829260
+Node: Hash Tables\7f1832770
+Node: Hash Table Concepts\7f1832946
+Node: Hash-Table Operations\7f1833178
+Node: Modifying Hash Table Keys\7f1835195
+Node: Visible Modification of Objects with respect to EQ and EQL\7f1837104
+Node: Visible Modification of Objects with respect to EQUAL\7f1837565
+Node: Visible Modification of Conses with respect to EQUAL\7f1838160
+Node: Visible Modification of Bit Vectors and Strings with respect to EQUAL\7f1838647
+Node: Visible Modification of Objects with respect to EQUALP\7f1839308
+Node: Visible Modification of Structures with respect to EQUALP\7f1839918
+Node: Visible Modification of Arrays with respect to EQUALP\7f1840399
+Node: Visible Modification of Hash Tables with respect to EQUALP\7f1841003
+Node: Visible Modifications by Language Extensions\7f1841712
+Node: Hash Tables Dictionary\7f1842472
+Node: hash-table\7f1842894
+Node: make-hash-table\7f1843671
+Node: hash-table-p\7f1846591
+Node: hash-table-count\7f1847338
+Node: hash-table-rehash-size\7f1848737
+Node: hash-table-rehash-threshold\7f1850255
+Node: hash-table-size\7f1851307
+Node: hash-table-test\7f1852085
+Node: gethash\7f1852948
+Node: remhash\7f1855115
+Node: maphash\7f1855963
+Node: with-hash-table-iterator\7f1857806
+Node: clrhash\7f1861243
+Node: sxhash\7f1862097
+Node: Filenames\7f1865079
+Node: Overview of Filenames\7f1865283
+Node: Namestrings as Filenames\7f1866082
+Node: Pathnames as Filenames\7f1867175
+Node: Parsing Namestrings Into Pathnames\7f1870523
+Node: Pathnames\7f1871265
+Node: Pathname Components\7f1871503
+Node: The Pathname Host Component\7f1871991
+Node: The Pathname Device Component\7f1872299
+Node: The Pathname Directory Component\7f1872680
+Node: The Pathname Name Component\7f1873029
+Node: The Pathname Type Component\7f1873346
+Node: The Pathname Version Component\7f1873759
+Node: Interpreting Pathname Component Values\7f1874408
+Node: Strings in Component Values\7f1875612
+Node: Special Characters in Pathname Components\7f1875883
+Node: Case in Pathname Components\7f1876787
+Node: Local Case in Pathname Components\7f1877573
+Node: Common Case in Pathname Components\7f1878372
+Node: Special Pathname Component Values\7f1879165
+Node: NIL as a Component Value\7f1879433
+Node: ->WILD as a Component Value\7f1879977
+Node: ->UNSPECIFIC as a Component Value\7f1881008
+Node: Relation between component values NIL and ->UNSPECIFIC\7f1882399
+Node: Restrictions on Wildcard Pathnames\7f1883246
+Node: Restrictions on Examining Pathname Components\7f1884109
+Node: Restrictions on Examining a Pathname Host Component\7f1885157
+Node: Restrictions on Examining a Pathname Device Component\7f1885596
+Node: Restrictions on Examining a Pathname Directory Component\7f1886300
+Node: Directory Components in Non-Hierarchical File Systems\7f1889825
+Node: Restrictions on Examining a Pathname Name Component\7f1890473
+Node: Restrictions on Examining a Pathname Type Component\7f1890900
+Node: Restrictions on Examining a Pathname Version Component\7f1891328
+Node: Notes about the Pathname Version Component\7f1892307
+Node: Restrictions on Constructing Pathnames\7f1892919
+Node: Merging Pathnames\7f1894461
+Node: Examples of Merging Pathnames\7f1895239
+Node: Logical Pathnames\7f1896119
+Node: Syntax of Logical Pathname Namestrings\7f1896358
+Node: Additional Information about Parsing Logical Pathname Namestrings\7f1898298
+Node: The Host part of a Logical Pathname Namestring\7f1898688
+Node: The Device part of a Logical Pathname Namestring\7f1899333
+Node: The Directory part of a Logical Pathname Namestring\7f1899864
+Node: The Type part of a Logical Pathname Namestring\7f1900462
+Node: The Version part of a Logical Pathname Namestring\7f1900957
+Node: Wildcard Words in a Logical Pathname Namestring\7f1901609
+Node: Lowercase Letters in a Logical Pathname Namestring\7f1902124
+Node: Other Syntax in a Logical Pathname Namestring\7f1902564
+Node: Logical Pathname Components\7f1903079
+Node: Unspecific Components of a Logical Pathname\7f1903386
+Node: Null Strings as Components of a Logical Pathname\7f1903818
+Node: Filenames Dictionary\7f1904180
+Node: pathname (System Class)\7f1904736
+Node: logical-pathname (System Class)\7f1905180
+Node: pathname\7f1905803
+Node: make-pathname\7f1908541
+Node: pathnamep\7f1913066
+Node: pathname-host\7f1913946
+Node: load-logical-pathname-translations\7f1918709
+Node: logical-pathname-translations\7f1920568
+Node: logical-pathname\7f1928617
+Node: *default-pathname-defaults*\7f1929989
+Node: namestring\7f1931212
+Node: parse-namestring\7f1935179
+Node: wild-pathname-p\7f1939941
+Node: pathname-match-p\7f1942074
+Node: translate-logical-pathname\7f1943297
+Node: translate-pathname\7f1945981
+Node: merge-pathnames\7f1952610
+Node: Files\7f1957252
+Node: File System Concepts\7f1957403
+Node: Coercion of Streams to Pathnames\7f1958386
+Node: File Operations on Open and Closed Streams\7f1959323
+Node: Truenames\7f1960561
+Node: Examples of Truenames\7f1961476
+Node: Files Dictionary\7f1963046
+Node: directory\7f1963363
+Node: probe-file\7f1964917
+Node: ensure-directories-exist\7f1966183
+Node: truename\7f1967814
+Node: file-author\7f1970456
+Node: file-write-date\7f1971487
+Node: rename-file\7f1972757
+Node: delete-file\7f1975291
+Node: file-error\7f1977098
+Node: file-error-pathname\7f1977857
+Node: Streams\7f1978406
+Node: Stream Concepts\7f1978556
+Node: Introduction to Streams\7f1978842
+Node: Abstract Classifications of Streams (Introduction to Streams)\7f1980048
+Node: Input\7f1980303
+Node: Open and Closed Streams\7f1981928
+Node: Interactive Streams\7f1982884
+Node: Abstract Classifications of Streams\7f1984280
+Node: File Streams\7f1984512
+Node: Other Subclasses of Stream\7f1985216
+Node: Stream Variables\7f1986431
+Node: Stream Arguments to Standardized Functions\7f1987714
+Node: Restrictions on Composite Streams\7f1990240
+Node: Streams Dictionary\7f1990747
+Node: stream\7f1992024
+Node: broadcast-stream\7f1992617
+Node: concatenated-stream\7f1995402
+Node: echo-stream\7f1996647
+Node: file-stream\7f1997403
+Node: string-stream\7f1997971
+Node: synonym-stream\7f1998594
+Node: two-way-stream\7f1999418
+Node: input-stream-p\7f1999974
+Node: interactive-stream-p\7f2001093
+Node: open-stream-p\7f2002182
+Node: stream-element-type\7f2003082
+Node: streamp\7f2004448
+Node: read-byte\7f2005111
+Node: write-byte\7f2006553
+Node: peek-char\7f2007678
+Node: read-char\7f2010490
+Node: read-char-no-hang\7f2012325
+Node: terpri\7f2014530
+Node: unread-char\7f2016098
+Node: write-char\7f2018071
+Node: read-line\7f2018956
+Node: write-string\7f2020977
+Node: read-sequence\7f2022577
+Node: write-sequence\7f2024878
+Node: file-length\7f2026505
+Node: file-position\7f2027547
+Node: file-string-length\7f2031414
+Node: open\7f2032195
+Node: stream-external-format\7f2041958
+Node: with-open-file\7f2042898
+Node: close\7f2046192
+Node: with-open-stream\7f2048359
+Node: listen\7f2049609
+Node: clear-input\7f2050730
+Node: finish-output\7f2052584
+Node: y-or-n-p\7f2054277
+Node: make-synonym-stream\7f2056926
+Node: synonym-stream-symbol\7f2058034
+Node: broadcast-stream-streams\7f2058559
+Node: make-broadcast-stream\7f2059105
+Node: make-two-way-stream\7f2060171
+Node: two-way-stream-input-stream\7f2061246
+Node: echo-stream-input-stream\7f2062097
+Node: make-echo-stream\7f2062863
+Node: concatenated-stream-streams\7f2063936
+Node: make-concatenated-stream\7f2064720
+Node: get-output-stream-string\7f2065623
+Node: make-string-input-stream\7f2067211
+Node: make-string-output-stream\7f2068378
+Node: with-input-from-string\7f2069505
+Node: with-output-to-string\7f2072065
+Node: *debug-io*\7f2074759
+Node: *terminal-io*\7f2079460
+Node: stream-error\7f2080976
+Node: stream-error-stream\7f2081625
+Node: end-of-file\7f2082370
+Node: Printer\7f2082860
+Node: The Lisp Printer\7f2083061
+Node: Overview of The Lisp Printer\7f2083344
+Node: Multiple Possible Textual Representations\7f2084046
+Node: Printer Escaping\7f2086168
+Node: Printer Dispatching\7f2087092
+Node: Default Print-Object Methods\7f2087658
+Node: Printing Numbers\7f2088569
+Node: Printing Integers\7f2088763
+Node: Printing Ratios\7f2089496
+Node: Printing Floats\7f2090246
+Node: Printing Complexes\7f2091881
+Node: Note about Printing Numbers\7f2092381
+Node: Printing Characters\7f2092729
+Node: Printing Symbols\7f2093668
+Node: Package Prefixes for Symbols\7f2095191
+Node: Effect of Readtable Case on the Lisp Printer\7f2097084
+Node: Examples of Effect of Readtable Case on the Lisp Printer\7f2098937
+Node: Printing Strings\7f2102668
+Node: Printing Lists and Conses\7f2103299
+Node: Printing Bit Vectors\7f2105745
+Node: Printing Other Vectors\7f2106394
+Node: Printing Other Arrays\7f2107892
+Node: Examples of Printing Arrays\7f2110153
+Node: Printing Random States\7f2110877
+Node: Printing Pathnames\7f2111762
+Node: Printing Structures\7f2112349
+Node: Printing Other Objects\7f2113291
+Node: Examples of Printer Behavior\7f2114167
+Node: The Lisp Pretty Printer\7f2115678
+Node: Pretty Printer Concepts\7f2115978
+Node: Dynamic Control of the Arrangement of Output\7f2117592
+Node: Format Directive Interface\7f2120633
+Node: Compiling Format Strings\7f2121881
+Node: Pretty Print Dispatch Tables\7f2122514
+Node: Pretty Printer Margins\7f2124118
+Node: Examples of using the Pretty Printer\7f2124615
+Node: Notes about the Pretty Printer`s Background\7f2136316
+Node: Formatted Output\7f2136837
+Node: FORMAT Basic Output\7f2141488
+Node: Tilde C-> Character\7f2141815
+Node: Tilde Percent-> Newline\7f2143627
+Node: Tilde Ampersand-> Fresh-Line\7f2143981
+Node: Tilde Vertical-Bar-> Page\7f2144391
+Node: Tilde Tilde-> Tilde\7f2144682
+Node: FORMAT Radix Control\7f2144891
+Node: Tilde R-> Radix\7f2145204
+Node: Tilde D-> Decimal\7f2146474
+Node: Tilde B-> Binary\7f2147789
+Node: Tilde O-> Octal\7f2148226
+Node: Tilde X-> Hexadecimal\7f2148664
+Node: FORMAT Floating-Point Printers\7f2149097
+Node: Tilde F-> Fixed-Format Floating-Point\7f2149494
+Node: Tilde E-> Exponential Floating-Point\7f2153585
+Node: Tilde G-> General Floating-Point\7f2158702
+Node: Tilde Dollarsign-> Monetary Floating-Point\7f2160069
+Node: FORMAT Printer Operations\7f2162335
+Node: Tilde A-> Aesthetic\7f2162634
+Node: Tilde S-> Standard\7f2163873
+Node: Tilde W-> Write\7f2164300
+Node: FORMAT Pretty Printer Operations\7f2165108
+Node: Tilde Underscore-> Conditional Newline\7f2165546
+Node: Tilde Less-Than-Sign-> Logical Block\7f2166038
+Node: Tilde I-> Indent\7f2169556
+Node: Tilde Slash-> Call Function\7f2169922
+Node: FORMAT Layout Control\7f2171782
+Node: Tilde T-> Tabulate\7f2172117
+Node: Tilde Less-Than-Sign-> Justification\7f2174342
+Node: Tilde Greater-Than-Sign-> End of Justification\7f2177758
+Node: FORMAT Control-Flow Operations\7f2178091
+Node: Tilde Asterisk-> Go-To\7f2178580
+Node: Tilde Left-Bracket-> Conditional Expression\7f2179473
+Node: Tilde Right-Bracket-> End of Conditional Expression\7f2181983
+Node: Tilde Left-Brace-> Iteration\7f2182384
+Node: Tilde Right-Brace-> End of Iteration\7f2185668
+Node: Tilde Question-Mark-> Recursive Processing\7f2186023
+Node: FORMAT Miscellaneous Operations\7f2187380
+Node: Tilde Left-Paren-> Case Conversion\7f2187743
+Node: Tilde Right-Paren-> End of Case Conversion\7f2189032
+Node: Tilde P-> Plural\7f2189386
+Node: FORMAT Miscellaneous Pseudo-Operations\7f2190168
+Node: Tilde Semicolon-> Clause Separator\7f2190566
+Node: Tilde Circumflex-> Escape Upward\7f2190951
+Node: Tilde Newline-> Ignored Newline\7f2194395
+Node: Additional Information about FORMAT Operations\7f2195807
+Node: Nesting of FORMAT Operations\7f2196251
+Node: Missing and Additional FORMAT Arguments\7f2197642
+Node: Additional FORMAT Parameters\7f2198135
+Node: Undefined FORMAT Modifier Combinations\7f2198536
+Node: Examples of FORMAT\7f2198947
+Node: Notes about FORMAT\7f2202971
+Node: Printer Dictionary\7f2203613
+Node: copy-pprint-dispatch\7f2204382
+Node: formatter\7f2205127
+Node: pprint-dispatch\7f2206324
+Node: pprint-exit-if-list-exhausted\7f2207860
+Node: pprint-fill\7f2209458
+Node: pprint-indent\7f2212901
+Node: pprint-logical-block\7f2214762
+Node: pprint-newline\7f2220256
+Node: pprint-pop\7f2224600
+Node: pprint-tab\7f2227816
+Node: print-object\7f2229206
+Node: print-unreadable-object\7f2233976
+Node: set-pprint-dispatch\7f2235801
+Node: write\7f2237992
+Node: write-to-string\7f2242063
+Node: *print-array*\7f2244275
+Node: *print-base*\7f2245123
+Node: *print-case*\7f2247436
+Node: *print-circle*\7f2249795
+Node: *print-escape*\7f2251416
+Node: *print-gensym*\7f2252557
+Node: *print-level*\7f2253208
+Node: *print-lines*\7f2256293
+Node: *print-miser-width*\7f2257680
+Node: *print-pprint-dispatch*\7f2258226
+Node: *print-pretty*\7f2259536
+Node: *print-readably*\7f2261450
+Node: *print-right-margin*\7f2265227
+Node: print-not-readable\7f2266105
+Node: print-not-readable-object\7f2266951
+Node: format\7f2267527
+Node: Reader\7f2269291
+Node: Reader Concepts\7f2269451
+Node: Dynamic Control of the Lisp Reader\7f2269737
+Node: Effect of Readtable Case on the Lisp Reader\7f2270123
+Node: Examples of Effect of Readtable Case on the Lisp Reader\7f2271168
+Node: Argument Conventions of Some Reader Functions\7f2272689
+Node: The EOF-ERROR-P argument\7f2273010
+Node: The RECURSIVE-P argument\7f2274639
+Node: Reader Dictionary\7f2277410
+Node: readtable\7f2277930
+Node: copy-readtable\7f2278739
+Node: make-dispatch-macro-character\7f2280646
+Node: read\7f2281907
+Node: read-delimited-list\7f2287124
+Node: read-from-string\7f2290835
+Node: readtable-case\7f2293315
+Node: readtablep\7f2294517
+Node: set-dispatch-macro-character\7f2295190
+Node: set-macro-character\7f2298273
+Node: set-syntax-from-char\7f2300843
+Node: with-standard-io-syntax\7f2302962
+Node: *read-base*\7f2304981
+Node: *read-default-float-format*\7f2306336
+Node: *read-eval*\7f2307881
+Node: *read-suppress*\7f2308591
+Node: *readtable*\7f2312240
+Node: reader-error\7f2313300
+Node: System Construction\7f2313834
+Node: System Construction Concepts\7f2314050
+Node: Loading\7f2314302
+Node: Features\7f2315259
+Node: Feature Expressions\7f2315768
+Node: Examples of Feature Expressions\7f2316791
+Node: System Construction Dictionary\7f2318381
+Node: compile-file\7f2318788
+Node: compile-file-pathname\7f2323551
+Node: load\7f2325601
+Node: with-compilation-unit\7f2331194
+Node: *features*\7f2333420
+Node: *compile-file-pathname*\7f2338857
+Node: *load-pathname*\7f2340169
+Node: *compile-print*\7f2341391
+Node: *load-print*\7f2341993
+Node: *modules*\7f2342631
+Node: provide\7f2343189
+Node: Environment\7f2346040
+Node: The External Environment\7f2346241
+Node: Top level loop\7f2346508
+Node: Debugging Utilities\7f2347363
+Node: Environment Inquiry\7f2347858
+Node: Time\7f2348547
+Node: Decoded Time\7f2349786
+Node: Universal Time\7f2351354
+Node: Internal Time\7f2352409
+Node: Seconds\7f2352989
+Node: Environment Dictionary\7f2353533
+Node: decode-universal-time\7f2354239
+Node: encode-universal-time\7f2356186
+Node: get-universal-time\7f2357356
+Node: sleep\7f2359506
+Node: apropos\7f2360593
+Node: describe\7f2362139
+Node: describe-object\7f2363987
+Node: trace\7f2366890
+Node: step\7f2369771
+Node: time\7f2371103
+Node: internal-time-units-per-second\7f2372983
+Node: get-internal-real-time\7f2373595
+Node: get-internal-run-time\7f2374450
+Node: disassemble\7f2375788
+Node: documentation\7f2377172
+Node: room\7f2383490
+Node: ed\7f2384588
+Node: inspect\7f2386051
+Node: dribble\7f2386947
+Node: - (Variable)\7f2388827
+Node: + (Variable)\7f2389470
+Node: * (Variable)\7f2390541
+Node: / (Variable)\7f2392088
+Node: lisp-implementation-type\7f2393234
+Node: short-site-name\7f2394466
+Node: machine-instance\7f2395429
+Node: machine-type\7f2396236
+Node: machine-version\7f2396898
+Node: software-type\7f2397610
+Node: user-homedir-pathname\7f2398628
+Node: Glossary (Glossary)\7f2399940
+Node: Glossary\7f2400395
+Node: Appendix\7f2561234
+Node: Removed Language Features\7f2561372
+Node: Requirements for removed and deprecated features\7f2561735
+Node: Removed Types\7f2562938
+Node: Removed Operators\7f2563171
+Node: Removed Argument Conventions\7f2563550
+Node: Removed Variables\7f2563868
+Node: Removed Reader Syntax\7f2564232
+Node: Packages No Longer Required\7f2564488
 \1f
 End Tag Table
 
index ef5d070361625b8b7eeb6d404e9d3a737001e3cd..bdc8b7f08b53d0fec82ed0e140ebe1023d056705 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -11,7 +11,10 @@ START-INFO-DIR-ENTRY
 END-INFO-DIR-ENTRY
 
 \1f
-File: gcl.info,  Node: Top,  Next: Introduction (Introduction),  Prev: (dir),  Up: (dir)
+File: gcl.info,  Node: Top,  Next: Introduction (Introduction),  Up: (dir)
+
+Top
+***
 
 * Menu:
 
@@ -2159,8 +2162,8 @@ Implementation.  For further information on Flavors, see Flavors: A
 Non-Hierarchical Approach to Object-Oriented Programming.
 
    These systems influenced the design of the Common Lisp Object System
-(CLOS). CLOS was developed specifically for this standardization effort,
-and was separately written up in Common Lisp Object System
+(CLOS).  CLOS was developed specifically for this standardization
+effort, and was separately written up in Common Lisp Object System
 Specification.  However, minor details of its design have changed
 slightly since that publication, and that paper should not be taken as
 an authoritative reference to the semantics of the object system as
@@ -2261,7 +2264,7 @@ File: gcl.info,  Node: Referenced Publications,  Next: Definitions,  Prev: Organ
 
 *
      Common Lisp Object System Specification, D. Bobrow, L. DiMichiel,
-     R.P. Gabriel, S. Keene, G. Kiczales, D. Moon, SIGPLAN Notices V23,
+     R.P.  Gabriel, S. Keene, G. Kiczales, D. Moon, SIGPLAN Notices V23,
      September, 1988.
 
 *
@@ -2343,7 +2346,7 @@ File: gcl.info,  Node: Referenced Publications,  Next: Definitions,  Prev: Organ
 
 *
      Smalltalk-80: The Language and its Implementation, A. Goldberg and
-     D. Robson, Addison-Wesley, 1983.
+     D.  Robson, Addison-Wesley, 1983.
 
 *
      Standard LISP Report, J.B. Marti, A.C. Hearn, M.L. Griss, and C.
@@ -2820,7 +2823,6 @@ of its many roles it is playing.
 
                Figure 1-1: Notations for NIL
 
-
    Within this document only, nil is also sometimes notated as false to
 emphasize its role as a boolean.
 
@@ -4025,7 +4027,6 @@ The functions in Figure 1-2 are deprecated.
 
             Figure 1-2: Deprecated Functions
 
-
 \1f
 File: gcl.info,  Node: Deprecated Argument Conventions,  Next: Deprecated Variables,  Prev: Deprecated Functions,  Up: Deprecated Language Features
 
@@ -4049,7 +4050,6 @@ The ability to pass a numeric argument to gensym has been deprecated.
 
   Figure 1-3: Functions with Deprecated :TEST-NOT Arguments
 
-
    The use of the situation names compile, load, and eval in eval-when
 is deprecated.
 
@@ -4123,7 +4123,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-4: Symbols in the COMMON-LISP package (part one of twelve).
 
-
   adjoin                      atom          boundp
   adjust-array                base-char     break
   adjustable-array-p          base-string   broadcast-stream
@@ -4165,7 +4164,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-5: Symbols in the COMMON-LISP package (part two of twelve).
 
-
   cddadr             clear-input                  copy-tree
   cddar              clear-output                 cos
   cdddar             close                        cosh
@@ -4207,7 +4205,6 @@ the 978 external symbols in the COMMON-LISP package.
 
     Figure 1-6: Symbols in the COMMON-LISP package (part three of twelve).
 
-
   denominator                    eq
   deposit-field                  eql
   describe                       equal
@@ -4249,7 +4246,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-7: Symbols in the COMMON-LISP package (part four of twelve).
 
-
   find-symbol                       get-internal-run-time
   finish-output                     get-macro-character
   first                             get-output-stream-string
@@ -4291,7 +4287,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-8: Symbols in the COMMON-LISP package (part five of twelve).
 
-
   intern                                  lisp-implementation-type
   internal-time-units-per-second          lisp-implementation-version
   intersection                            list
@@ -4333,7 +4328,6 @@ the 978 external symbols in the COMMON-LISP package.
 
      Figure 1-9: Symbols in the COMMON-LISP package (part six of twelve).
 
-
   machine-version                mask-field
   macro-function                 max
   macroexpand                    member
@@ -4375,7 +4369,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-10: Symbols in the COMMON-LISP package (part seven of twelve).
 
-
   nintersection         package-error
   ninth                 package-error-package
   no-applicable-method  package-name
@@ -4417,7 +4410,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-11: Symbols in the COMMON-LISP package (part eight of twelve).
 
-
   pprint-tab                 read-char
   pprint-tabular             read-char-no-hang
   prin1                      read-delimited-list
@@ -4459,7 +4451,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-12: Symbols in the COMMON-LISP package (part nine of twelve).
 
-
   room                          simple-bit-vector
   rotatef                       simple-bit-vector-p
   round                         simple-condition
@@ -4501,7 +4492,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-13: Symbols in the COMMON-LISP package (part ten of twelve).
 
-
   standard-class             sublis
   standard-generic-function  subseq
   standard-method            subsetp
@@ -4543,7 +4533,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-14: Symbols in the COMMON-LISP package (part eleven of twelve).
 
-
   truncate                             values-list
   two-way-stream                       variable
   two-way-stream-input-stream          vector
@@ -4580,7 +4569,6 @@ the 978 external symbols in the COMMON-LISP package.
 
   Figure 1-15: Symbols in the COMMON-LISP package (part twelve of twelve).
 
-
 \1f
 File: gcl.info,  Node: Syntax,  Next: Evaluation and Compilation,  Prev: Introduction (Introduction),  Up: Top
 
@@ -4638,7 +4626,6 @@ readtables.
 
               Figure 2-1: Readtable defined names
 
-
 * Menu:
 
 * The Current Readtable::
@@ -4699,7 +4686,6 @@ influence the behavior of the Lisp reader.
 
   Figure 2-2: Variables that influence the Lisp reader.
 
-
 \1f
 File: gcl.info,  Node: Standard Characters,  Next: Character Syntax Types,  Prev: Variables that affect the Lisp Reader,  Up: Character Syntax
 
@@ -4744,7 +4730,6 @@ ninety-four graphic characters or their equivalents:
 
   Figure 2-3: Standard Character Subrepertoire (Part 1 of 3: Latin Characters)
 
-
   Graphic ID  Glyph  Description  Graphic ID  Glyph  Description
   ND01        1      digit 1      ND06        6      digit 6
   ND02        2      digit 2      ND07        7      digit 7
@@ -4754,7 +4739,6 @@ ninety-four graphic characters or their equivalents:
 
   Figure 2-4: Standard Character Subrepertoire (Part 2 of 3: Numeric Characters)
 
-
   Graphic ID  Glyph  Description
   SP02        !      exclamation mark
   SC03        $     dollar sign
@@ -4791,7 +4775,6 @@ ninety-four graphic characters or their equivalents:
 
   Figure 2-5: Standard Character Subrepertoire (Part 3 of 3: Special Characters)
 
-
    The graphic IDs are not used within Common Lisp, but are provided for
 cross reference purposes with ISO 6937/2.  Note that the first letter of
 the graphic ID categorizes the character as follows: L--Latin,
@@ -4820,7 +4803,6 @@ one of the syntax types shown in Figure~2-6.
 
   Figure 2-6: Possible Character Syntax Types
 
-
    The syntax type of a character in a readtable determines how that
 character is interpreted by the Lisp reader while that readtable is the
 current readtable.  At any given time, every character has exactly one
@@ -4855,7 +4837,6 @@ syntax.
 
             Figure 2-7: Character Syntax Types in Standard Syntax
 
-
    The characters marked with an asterisk (*) are initially
 constituents, but they are not used in any standard Common Lisp
 notations.  These characters are explicitly reserved to the programmer.
@@ -5399,7 +5380,6 @@ implementation is permitted, but not required, to define their meaning.
 
                      Figure 2-10: Examples of reserved tokens
 
-
    The tokens in Figure 2-11 are not potential numbers; they are always
 treated as symbols:
 
@@ -5408,7 +5388,6 @@ treated as symbols:
 
   Figure 2-11: Examples of symbols
 
-
    The tokens in Figure 2-12 are potential numbers if the current input
 base is 16, but they are always treated as symbols if the current input
 base is 10.
@@ -5417,7 +5396,6 @@ base is 10.
 
   Figure 2-12: Examples of symbols or potential numbers
 
-
 \1f
 File: gcl.info,  Node: Constructing Numbers from Tokens,  Next: The Consing Dot,  Prev: Numbers as Tokens,  Up: Interpretation of Tokens
 
@@ -5489,7 +5467,6 @@ Figure 2-13.
 
                   Figure 2-13: Examples of Ratios
 
-
    [Reviewer Note by Barmar: #o, #3r, #X, and #x mentioned above are not
 in the syntax rules defined just above that.]
 
@@ -5545,7 +5522,6 @@ external representation.
 
                Figure 2-14: Examples of Floating-point numbers
 
-
    For information on how floats are printed, see *note Printing
 Floats::.
 
@@ -5624,7 +5600,6 @@ case of the current readtable is :upcase.
 
   Figure 2-15: Examples of the printed representation of symbols (Part 1 of 2)
 
-
   APL\\360               The symbol whose name is APL\360.
   apl\\360               Also the symbol whose name is APL\360.
   \(b^2\)\ -\ 4*a*c    The name is (B^2) - 4*A*C.
@@ -5644,7 +5619,6 @@ case of the current readtable is :upcase.
 
   Figure 2-16: Examples of the printed representation of symbols (Part 2 of 2)
 
-
    In the process of parsing a symbol, it is implementation-dependent
 which implementation-defined attributes are removed from the characters
 forming a token that represents a symbol.
@@ -5683,7 +5657,6 @@ The valid patterns for tokens are summarized in Figure 2-17.
 
                  Figure 2-17: Valid patterns for tokens
 
-
    Note that nnnnn has number syntax, neither xxxxx nor ppppp has number
 syntax, and aaaaa has any syntax.
 
@@ -6031,7 +6004,6 @@ characters are removed in this process.
 
           Figure 2-18: Examples of the use of double-quote
 
-
    Note that to place a single escape character or a double-quote into a
 string, such a character must be preceded by a single escape character.
 Note, too, that a multiple escape character need not be quoted by a
@@ -6252,7 +6224,6 @@ are described later in this section and summarized in Figure 2-19.
 
            Figure 2-19: Standard # Dispatching Macro Character Syntax
 
-
    The combinations marked by an asterisk (*) are explicitly reserved to
 the user.  No conforming implementation defines them.
 
@@ -6537,7 +6508,6 @@ point suffices.
 
         Figure 2-20: Radix Indicator Example
 
-
    The consequences are undefined if the token immediately following the
 #nR does not have the syntax of a rational in radix n.
 
@@ -6568,7 +6538,6 @@ complex.
 
                   Figure 2-21: Complex Number Example
 
-
    For further information, see *note Printing Complexes:: and *note
 Syntax of a Complex::.
 
@@ -7163,7 +7132,6 @@ assigning, binding, and defining variables.
 
   Figure 3-1: Some Defined Names Applicable to Variables
 
-
    The following is a description of each kind of variable.
 
 \1f
@@ -7326,7 +7294,6 @@ operators.
 
       Figure 3-2: Common Lisp Special Operators
 
-
 \1f
 File: gcl.info,  Node: Macro Forms,  Next: Function Forms,  Prev: Special Forms,  Up: The Evaluation Model
 
@@ -7368,7 +7335,6 @@ is also provided.
 
     Figure 3-3: Defined names applicable to macros
 
-
 \1f
 File: gcl.info,  Node: Function Forms,  Next: Lambda Forms,  Prev: Macro Forms,  Up: The Evaluation Model
 
@@ -7426,7 +7392,6 @@ in the lexical environment can be established by flet or labels.
 
       Figure 3-4: Some function-related defined names
 
-
 \1f
 File: gcl.info,  Node: Lambda Forms,  Next: Self-Evaluating Objects,  Prev: Function Forms,  Up: The Evaluation Model
 
@@ -7742,7 +7707,6 @@ where to put the values returned by those forms.
 
   Figure 3-5: Some operators applicable to receiving multiple values
 
-
    The function values can produce multiple values_2.  (values) returns
 zero values; (values form) returns the primary value returned by form;
 (values form1 form2) returns two values, the primary value of form1 and
@@ -7915,7 +7879,6 @@ of the original form.
 
         Figure 3-6: Defined names applicable to compiler macros
 
-
 \1f
 File: gcl.info,  Node: Purpose of Compiler Macros,  Next: Naming of Compiler Macros,  Prev: Compiler Macros,  Up: Compilation Semantics
 
index 56ffe0a55bcaefb823a7677c162fa1360a10b023..06ecd5401ece453a8733c76bd0bb1dfa57a84dce 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -63,7 +63,6 @@ only when the defining macros appear at top level.
 
   Figure 3-8: Defining Macros That Affect the Compile-Time Environment
 
-
 \1f
 File: gcl.info,  Node: Constraints on Macros and Compiler Macros,  Prev: Processing of Defining Macros,  Up: File Compilation
 
@@ -528,7 +527,6 @@ Figure 3-9 shows a list of all declaration identifiers
 
   Figure 3-9: Common Lisp Declaration Identifiers
 
-
    An implementation is free to support other (implementation-defined)
 declaration identifiers as well.  A warning might be issued if a
 declaration identifier is not among those defined above, is not defined
@@ -710,7 +708,6 @@ parameters.
 
                          Figure 3-10: What Kind of Lambda Lists to Use
 
-
    Figure 3-11 lists some defined names that are applicable to lambda
 lists.
 
@@ -718,7 +715,6 @@ lists.
 
   Figure 3-11: Defined names applicable to lambda lists
 
-
 * Menu:
 
 * Ordinary Lambda Lists::
@@ -749,7 +745,6 @@ those which use ordinary lambda lists:
 
   Figure 3-12: Standardized Operators that use Ordinary Lambda Lists
 
-
    An ordinary lambda list can contain the lambda list keywords shown in
 Figure 3-13.
 
@@ -758,7 +753,6 @@ Figure 3-13.
 
   Figure 3-13: Lambda List Keywords used by Ordinary Lambda Lists
 
-
    Each element of a lambda list is either a parameter specifier or a
 lambda list keyword.  Implementations are free to provide additional
 lambda list keywords.  For a list of all lambda list keywords used by
@@ -1099,7 +1093,6 @@ shown in Figure 3-14.
 
   Figure 3-14: Lambda List Keywords used by Generic Function Lambda Lists
 
-
    A generic function lambda list differs from an ordinary lambda list
 in the following ways:
 
@@ -1129,7 +1122,6 @@ each for information about how.
 
   Figure 3-15: Standardized Operators that use Specialized Lambda Lists
 
-
    A specialized lambda list can contain the lambda list keywords shown
 in Figure 3-16.
 
@@ -1138,7 +1130,6 @@ in Figure 3-16.
 
   Figure 3-16: Lambda List Keywords used by Specialized Lambda Lists
 
-
    A specialized lambda list is syntactically the same as an ordinary
 lambda list except that each required parameter may optionally be
 associated with a class or object for which that parameter is
@@ -1164,7 +1155,6 @@ operators in Figure 3-17.
 
   Figure 3-17: Operators that use Macro Lambda Lists
 
-
    With the additional restriction that an environment parameter may
 appear only once (at any of the positions indicated), a macro lambda
 list has the following syntax:
@@ -1200,7 +1190,6 @@ Figure 3-18.
 
   Figure 3-18: Lambda List Keywords used by Macro Lambda Lists
 
-
    Optional parameters (introduced by &optional) and keyword parameters
 (introduced by &key) can be supplied in a macro lambda list, just as in
 an ordinary lambda list.  Both may contain default initialization forms
@@ -1576,7 +1565,6 @@ Figure 3-19.
 
   Figure 3-19: Lambda List Keywords used by Defsetf Lambda Lists
 
-
    A defsetf lambda list differs from an ordinary lambda list only in
 that it does not permit the use of &aux, and that it permits use of
 &environment, which introduces an environment parameter.
@@ -1612,7 +1600,6 @@ keywords shown in Figure 3-20.
 
   Figure 3-20: Lambda List Keywords used by Define-modify-macro Lambda Lists
 
-
    Define-modify-macro lambda lists are similar to ordinary lambda
 lists, but do not support keyword arguments.  define-modify-macro has no
 need match keyword arguments, and a rest parameter is sufficient.  Aux
@@ -1637,7 +1624,6 @@ lambda list keywords shown in Figure 3-21.
 
   Figure 3-21: Lambda List Keywords used by Define-method-combination arguments Lambda Lists
 
-
    Define-method-combination arguments lambda lists are similar to
 ordinary lambda lists, but also permit the use of &whole.
 
@@ -3589,7 +3575,6 @@ with proclaim.
 
   Figure 3-22: Global Declaration Specifiers
 
-
    An implementation is free to support other (implementation-defined)
 declaration identifiers as well.
 
@@ -3707,7 +3692,6 @@ the forms listed in Figure 3-23.
 
        Figure 3-23: Standardized Forms In Which Declarations Can Occur
 
-
    A declare expression can only occur where specified by the syntax of
 these forms.  The consequences of attempting to evaluate a declare
 expression are undefined.  In situations where such expressions can
@@ -3727,7 +3711,6 @@ with declare.
 
   Figure 3-24: Local Declaration Specifiers
 
-
    An implementation is free to support other (implementation-defined)
 declaration identifiers as well.
 
@@ -3928,7 +3911,6 @@ f.
         (flet ((g (x) (declare (dynamic-extent x)) ...))
           (g (list 1 2 3))))
 
-
    In the previous example, some compilers might determine that
 optimization was possible and others might not.
 
@@ -4491,7 +4473,6 @@ standard optimize qualities are shown in Figure 3-25.
 
              Figure 3-25: Optimize qualities
 
-
    There may be other, implementation-defined optimize qualities.
 
    A value 0 means that the corresponding quality is totally
@@ -5026,20 +5007,21 @@ Figure~4-1.  Figure~4-7 lists some classes that are particularly
 relevant to the object system.  Figure~9-1 lists the defined condition
 types.
 
-  Section                                Data Type
-  _________________________________________________________________________
-  *note Classes::                        Object System types
-  *note Slots::                          Object System types
-  *note Objects::                        Object System types
-  *note Generic Functions and Methods::  Object System types
-  *note Condition System Concepts::      Condition System types
-  *note Types and Classes::              Miscellaneous types
-  *note Syntax::                         All types--read and print syntax
-  *note The Lisp Printer::               All types--print syntax
-  *note Compilation::                    All types--compilation issues
 
-           Figure 4-1: Cross-References to Data Type Information
+Section                                Data Type
+--------------------------------------------------------------------------
+*note Classes::                        Object System types
+*note Slots::                          Object System types
+*note Objects::                        Object System types
+*note Generic Functions and Methods::  Object System types
+*note Condition System Concepts::      Condition System types
+*note Types and Classes::              Miscellaneous types
+*note Syntax::                         All types--read and print syntax
+*note The Lisp Printer::               All types--print syntax
+*note Compilation::                    All types--compilation issues
+
 
+         Figure 4-1: Cross-References to Data Type Information
 
 \1f
 File: gcl.info,  Node: Type Relationships,  Next: Type Specifiers,  Prev: Data Type Definition,  Up: Types
@@ -5141,7 +5123,6 @@ define-condition, defstruct, or deftype.
 
                  Figure 4-2: Standardized Atomic Type Specifiers
 
-
    \indent If a type specifier is a list, the car of the list is a
 symbol, and the rest of the list is subsidiary type information.  Such a
 type specifier is called a compound type specifier .  Except as
@@ -5185,7 +5166,6 @@ abbreviated to (vector) and then to vector.
 
   Figure 4-3: Standardized Compound Type Specifier Names
 
-
    Figure 4-4 show the defined names that can be used as compound type
 specifier names but that cannot be used as atomic type specifiers.
 
@@ -5195,7 +5175,6 @@ specifier names but that cannot be used as atomic type specifiers.
 
   Figure 4-4: Standardized Compound-Only Type Specifier Names
 
-
    New type specifiers can come into existence in two ways.
 
 *
@@ -5221,7 +5200,6 @@ declarations.
 
   Figure 4-5: Defined names relating to types and declarations.
 
-
    Figure 4-6 shows all defined names that are type specifier names,
 whether for atomic type specifiers or compound type specifiers; this
 list is the union of the lists in Figure~4-2 and Figure~4-3.
@@ -5264,7 +5242,6 @@ list is the union of the lists in Figure~4-2 and Figure~4-3.
 
                   Figure 4-6: Standardized Type Specifier Names
 
-
 \1f
 File: gcl.info,  Node: Classes,  Next: Types and Classes Dictionary,  Prev: Types,  Up: Types and Classes
 
@@ -5283,7 +5260,6 @@ understanding the object system.
 
                 Figure 4-7: Object System Classes
 
-
 * Menu:
 
 * Introduction to Classes::
@@ -5975,7 +5951,6 @@ type specifiers.
 
        Figure 4-8: Classes that correspond to pre-defined type specifiers
 
-
    The class precedence list information specified in the entries for
 each of these classes are those that are required by the object system.
 
@@ -7050,7 +7025,6 @@ result.
 
                Figure 4-9: Result possibilities for subtypep
 
-
    subtypep is permitted to return the values false and false only when
 at least one argument involves one of these type specifiers: and, eql,
 the list form of function, member, not, or, satisfies, or values.  (A
@@ -7246,7 +7220,6 @@ element.  The typespec satisfies the following:
 Examples::
 ..........
 
-
       (type-of 'a) ⇒  SYMBOL
       (type-of '(1 . 2))
      ⇒  CONS
@@ -7391,7 +7364,6 @@ Implementations are encouraged to recognize and optimize the case of
 expansion of deftype information at runtime.
 
 
-
 \1f
 File: gcl.info,  Node: type-error,  Next: type-error-datum,  Prev: typep,  Up: Types and Classes Dictionary
 
@@ -7553,7 +7525,6 @@ value or values being stored.
 
                      Figure 5-1: Examples of setf
 
-
    Figure 5-2 shows operators relating to places and generalized
 reference.
 
@@ -7566,7 +7537,6 @@ reference.
 
   Figure 5-2: Operators relating to places and generalized reference.
 
-
    Some of the operators above manipulate places and some manipulate
 setf expanders.  A setf expansion can be derived from any place.
 
@@ -7742,7 +7712,6 @@ Examples of the contents of the constituents of setf expansions follow.
 
   Figure 5-3: Sample Setf Expansion of a Variable
 
-
    For (car exp):
 
   (g0002)                             ;list of temporary variables
@@ -7753,7 +7722,6 @@ Examples of the contents of the constituents of setf expansions follow.
 
            Figure 5-4: Sample Setf Expansion of a CAR Form
 
-
    For (subseq seq s e):
 
   (g0004 g0005 g0006)         ;list of temporary variables
@@ -7765,7 +7733,6 @@ Examples of the contents of the constituents of setf expansions follow.
 
      Figure 5-5: Sample Setf Expansion of a SUBSEQ Form
 
-
    In some cases, if a subform of a place is itself a place, it is
 necessary to expand the subform in order to compute some of the values
 in the expansion of the outer place.  For (ldb bs (car exp)):
@@ -7779,7 +7746,6 @@ in the expansion of the outer place.  For (ldb bs (car exp)):
 
      Figure 5-6: Sample Setf Expansion of a LDB Form
 
-
 \1f
 File: gcl.info,  Node: Kinds of Places,  Next: Treatment of Other Macros Based on SETF,  Prev: Overview of Places and Generalized Reference,  Up: Generalized Reference
 
@@ -7856,7 +7822,6 @@ following categories:
 
             Figure 5-7: Functions that setf can be used with--1
 
-
      In the case of subseq, the replacement value must be a sequence
      whose elements might be contained by the sequence argument to
      subseq, but does not have to be a sequence of the same type as the
@@ -7886,7 +7851,6 @@ following categories:
 
               Figure 5-8: Functions that setf can be used with--2
 
-
      During the setf expansion of these forms, it is necessary to call
 
      get-setf-expansion
@@ -8203,7 +8167,6 @@ form with the following general syntax:
 
   Figure 5-9: Read-Modify-Write Macros
 
-
 \1f
 File: gcl.info,  Node: Transfer of Control to an Exit Point,  Next: Data and Control Flow Dictionary,  Prev: Generalized Reference,  Up: Data and Control Flow
 
index 468ae3e40252dee13f940a670c58eee3888eb322..cb3a776434314bb84d29b30a42406cd7887f0177 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -2093,7 +2093,6 @@ The macros in Figure 5-10 have implicit tagbodies.
 
   Figure 5-10: Macros that have implicit tagbodies.
 
-
 \1f
 File: gcl.info,  Node: throw,  Next: unwind-protect,  Prev: tagbody,  Up: Data and Control Flow Dictionary
 
@@ -2132,7 +2131,6 @@ Examples::
          (loop (incf j 3) (incf i)
                (if (= i 3) (throw 'result (values i j))))) ⇒  3, 9
 
-
       (catch nil
         (unwind-protect (throw nil 1)
           (throw nil 2))) ⇒  2
@@ -2541,7 +2539,6 @@ them:
 
   Figure 5-11: Operators that always prefer EQ over EQL
 
-
 \1f
 File: gcl.info,  Node: eql,  Next: equal,  Prev: eq,  Up: Data and Control Flow Dictionary
 
@@ -2703,7 +2700,6 @@ behavior of equal, with upper entries taking priority over lower ones.
 
   Figure 5-12: Summary and priorities of behavior of equal
 
-
    Any two objects that are eql are also equal.
 
    equal may fail to terminate if x or y is circular.
@@ -2820,7 +2816,6 @@ behavior of equalp, with upper entries taking priority over lower ones.
 
   Figure 5-13: Summary and priorities of behavior of equalp
 
-
 Examples::
 ..........
 
@@ -4886,7 +4881,6 @@ Examples::
       (flet ((frob (x) (cdr x)))  ;Invalid
         (xpop (frob z)))
 
-
 See Also::
 ..........
 
@@ -6007,7 +6001,6 @@ File: gcl.info,  Node: Examples of for-as-on-list subclause,  Next: The for-as-e
       |>  3
      ⇒  NIL
 
-
 \1f
 File: gcl.info,  Node: The for-as-equals-then subclause,  Next: Examples of for-as-equals-then subclause,  Prev: Examples of for-as-on-list subclause,  Up: Variable Initialization and Stepping Clauses
 
@@ -6752,7 +6745,6 @@ File: gcl.info,  Node: Examples of unconditional execution,  Prev: Unconditional
       |>  9
      ⇒  NIL
 
-
 \1f
 File: gcl.info,  Node: Conditional Execution Clauses,  Next: Miscellaneous Clauses,  Prev: Unconditional Execution Clauses,  Up: The LOOP Facility
 
@@ -7731,7 +7723,6 @@ Examples::
       (tokenize-sentence "this is a sentence")
      ⇒  ("this" "is" "a" "sentence"), NIL
 
-
 Side Effects::
 ..............
 
@@ -8107,7 +8098,6 @@ nor evaluated.
       (make-instance 'r 'b 4)      (b 4 a 1)                    4
       (make-instance 'r 'a 1 'a 2) (a 1 a 2 b 2)                1
 
-
 \1f
 File: gcl.info,  Node: Shared-Initialize,  Next: Initialize-Instance,  Prev: Rules for Initialization Arguments,  Up: Object Creation and Initialization
 
@@ -8768,7 +8758,6 @@ method-defining operators are listed in Figure 7-2.
 
   Figure 7-2: Standardized Method-Defining Operators
 
-
    Note that of the standardized method-defining operators only
 defgeneric can specify generic function options.  defgeneric and any
 implementation-defined operators that can specify generic function
index ae9820f1b8a7ea4e86901c22c3b9c6b8629cd54b..35ae334f18997a2783baf88307524b496c14f8f0 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -431,7 +431,6 @@ Figure 7-3.
 
   Figure 7-3: Built-in Method Combination Types
 
-
    The semantics of the standard built-in method combination type is
 described in *note Standard Method Combination::.  The other built-in
 method combination types are called simple built-in method combination
@@ -1190,7 +1189,6 @@ Examples::
                    theta (atan new-y x))
              new-y)))
 
-
 Exceptional Situations::
 ........................
 
@@ -1307,7 +1305,6 @@ Examples::
      ;;; on the value of the x and y slots, which were maintained by
      ;;; the old instance.
 
-
 See Also::
 ..........
 
@@ -2397,7 +2394,6 @@ A with-accessors expression of the form:
 
      (with-accessors (slot-entry_1 ...slot-entry_n) instance-form form_1 ...form_k)
 
-
 expands into the equivalent of
 
 
@@ -2405,7 +2401,6 @@ expands into the equivalent of
 
       (symbol-macrolet (Q_1... Q_n) form_1 ...form_k))
 
-
 where Q_i is
 
      (variable-name_i ()
@@ -2509,7 +2504,6 @@ A with-slots expression of the form:
 
      (with-slots (slot-entry_1 ...slot-entry_n) instance-form form_1 ...form_k)
 
-
 expands into the equivalent of
 
 
@@ -2517,7 +2511,6 @@ expands into the equivalent of
 
       (symbol-macrolet (Q_1... Q_n) form_1 ...form_k))
 
-
 where Q_i is
 
      (slot-entry_i ()
@@ -4022,7 +4015,6 @@ the declarative method combination facility.
                               methods))
            (unlock (object-lock ,object))))
 
-
 Side Effects::
 ..............
 
@@ -5536,7 +5528,6 @@ types can be defined by using define-condition.
 
                     Figure 9-1: Standardized Condition Types
 
-
    All condition types are subtypes of type condition.  That is,
 
       (typep c 'condition) ⇒  true
@@ -5560,7 +5551,6 @@ conditions.
 
   Figure 9-2: Operators that define and create conditions.
 
-
    Figure 9-3 shows operators that read the value of condition slots.
 
   arithmetic-error-operands   simple-condition-format-arguments
@@ -5572,7 +5562,6 @@ conditions.
 
          Figure 9-3: Operators that read condition slots.
 
-
 * Menu:
 
 * Serious Conditions::
@@ -5851,7 +5840,6 @@ will be considered for possible invocation.
 
   Figure 9-4: Operators relating to handling conditions.
 
-
 * Menu:
 
 * Signaling::
@@ -5894,7 +5882,6 @@ conditions.
 
   Figure 9-5: Defined names relating to signaling conditions.
 
-
 \1f
 File: gcl.info,  Node: Resignaling a Condition,  Next: Restarts,  Prev: Signaling,  Up: Signaling and Handling Conditions
 
@@ -6015,7 +6002,6 @@ notational convenience.
 
             Figure 9-6: Defined names relating to restarts.
 
-
 \1f
 File: gcl.info,  Node: Restart Tests,  Next: Associating a Restart with a Condition,  Prev: Interfaces to Restarts,  Up: Signaling and Handling Conditions
 
@@ -6063,7 +6049,6 @@ form evaluation, and type are handled by assertion operators.  Figure
 
   Figure 9-7: Operators relating to assertions.
 
-
 \1f
 File: gcl.info,  Node: Notes about the Condition System`s Background,  Prev: Assertions,  Up: Condition System Concepts
 
@@ -6903,7 +6888,6 @@ Examples::
       |>  Type a form to be evaluated and used instead: |>>5<<|
      ⇒  (defun add5 (x) (+ x 5))
 
-
    Control is transferred to a handler.
 
 Side Effects::
@@ -7423,7 +7407,6 @@ Examples::
       |>  Return from BREAK.
      ⇒  NIL
 
-
 Side Effects::
 ..............
 
index 90eef71e854fb9ed98e012bfffde856441b8f64b..5d3358e364376a57de1fd424cd80dc6285b48cf6 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -162,7 +162,6 @@ Examples::
       ;; also returns information about any system-supplied restarts, such as
       ;; the "Return to Lisp Toplevel" restart offered above.
 
-
 Affected By::
 .............
 
@@ -1294,7 +1293,6 @@ Examples::
       (setq x 1 y 2) ⇒  2
       (add-symbols-with-default 3 'x 'y 'z) ⇒  6
 
-
 Side Effects::
 ..............
 
@@ -1358,7 +1356,6 @@ lists of symbols.
 
   Figure 10-1: Property list defined names
 
-
    Figure 10-2 lists some defined names that are applicable to the
 creation of and inquiry about symbols.
 
@@ -1368,7 +1365,6 @@ creation of and inquiry about symbols.
 
   Figure 10-2: Symbol creation and inquiry defined names
 
-
 \1f
 File: gcl.info,  Node: Symbols Dictionary,  Prev: Symbol Concepts,  Up: Symbols
 
@@ -2737,7 +2733,6 @@ symbol is supplied, its name will be used as the package name.
 
          Figure 11-1: Some Defined Names related to Packages
 
-
 * Menu:
 
 * Package Names and Nicknames::
@@ -2960,7 +2955,6 @@ those standardized packages is given in Figure 11-2.
 
   Figure 11-2: Standardized Package Names
 
-
 * Menu:
 
 * The COMMON-LISP Package::
@@ -3756,7 +3750,6 @@ Examples::
       (export 'test-2::test (find-package 'test-2)) ⇒  T
       (use-package 'test-2 (find-package 'test-1))    ;should not error
 
-
 Side Effects::
 ..............
 
@@ -5303,7 +5296,6 @@ into categories that emphasize some of the relationships among them.
 
   Figure 12-1: Operators relating to Arithmetic.
 
-
    Figure 12-2 shows defined names relating to exponential, logarithmic,
 and trigonometric operations.
 
@@ -5318,7 +5310,6 @@ and trigonometric operations.
 
   Figure 12-2: Defined names relating to Exponentials, Logarithms, and Trigonometry.
 
-
    Figure 12-3 shows operators relating to numeric comparison and
 predication.
 
@@ -5330,7 +5321,6 @@ predication.
 
   Figure 12-3: Operators for numeric comparison and predication.
 
-
    Figure 12-4 shows defined names relating to numeric type manipulation
 and coercion.
 
@@ -5346,7 +5336,6 @@ and coercion.
 
   Figure 12-4: Defined names relating to numeric type manipulation and coercion.
 
-
 * Menu:
 
 * Associativity and Commutativity in Numeric Operations::
@@ -5456,7 +5445,6 @@ numbers.
 
   Figure 12-5: Defined names relating to logical operations on numbers.
 
-
 \1f
 File: gcl.info,  Node: Byte Operations on Integers,  Prev: Logical Operations on Integers,  Up: Numeric Operations
 
@@ -5478,7 +5466,6 @@ numbers.
 
   Figure 12-6: Defined names relating to byte manipulation.
 
-
 \1f
 File: gcl.info,  Node: Implementation-Dependent Numeric Constants,  Next: Rational Computations,  Prev: Numeric Operations,  Up: Number Concepts
 
@@ -5504,7 +5491,6 @@ details about numbers.
 
   Figure 12-7: Defined names relating to implementation-dependent details about numbers.
 
-
 \1f
 File: gcl.info,  Node: Rational Computations,  Next: Floating-point Computations,  Prev: Implementation-Dependent Numeric Constants,  Up: Number Concepts
 
@@ -5606,7 +5592,6 @@ single-float).
 
   Figure 12-8: Functions Affected by Rule of Float Substitutability
 
-
 \1f
 File: gcl.info,  Node: Floating-point Computations,  Next: Complex Computations,  Prev: Rational Computations,  Up: Number Concepts
 
@@ -5803,7 +5788,6 @@ applicable portion of the complex domain, even on the branch cuts:
 
          Figure 12-9: Trigonometric Identities for Complex Domain
 
-
    The quadrant numbers referred to in the discussions of branch cuts
 are as illustrated in Figure 12-10.
 
@@ -5824,7 +5808,6 @@ are as illustrated in Figure 12-10.
                                 |
                                 |
 
-
     Figure 12-9: Quadrant Numbering for Branch Cuts
 
 \1f
@@ -5882,7 +5865,6 @@ states.
 
   Figure 12-10: Random-state defined names
 
-
 \1f
 File: gcl.info,  Node: Numbers Dictionary,  Prev: Number Concepts,  Up: Numbers (Numbers)
 
@@ -6261,7 +6243,6 @@ minus zero.
 
   Figure 12-11: Recommended Minimum Floating-Point Precision and Exponent Size
 
-
    There can be fewer than four internal representations for floats.  If
 there are fewer distinct representations, the following rules apply:
 
@@ -6749,7 +6730,6 @@ The uses of these functions are illustrated in Figure 12-12.
 
          Figure 12-12: Uses of /=, =, <, >, <=, and >=
 
-
 Exceptional Situations::
 ........................
 
@@ -7153,7 +7133,6 @@ specified as x as in Figure 12-13.
 
   Figure 12-13: Mathematical definition of arc sine, arc cosine, and arc tangent
 
-
    These formulae are mathematically correct, assuming completely
 accurate computation.  They are not necessarily the simplest ones for
 real-valued computations.
@@ -7264,7 +7243,6 @@ implementations that support minus zero.
 
                Figure 12-14: Quadrant information for arc tangent
 
-
 Examples::
 ..........
 
@@ -7376,7 +7354,6 @@ for an argument x as given in Figure 12-15.
 
     Figure 12-15: Mathematical definitions for hyperbolic functions
 
-
    The following definition for the inverse hyperbolic cosine determines
 the range and branch cuts:
 
@@ -8119,7 +8096,7 @@ even if an exact integer result is possible.
 
    The branch cut for the logarithm function of one argument (natural
 logarithm) lies along the negative real axis, continuous with quadrant
-II. The domain excludes the origin.
+II.  The domain excludes the origin.
 
    The mathematical definition of a complex logarithm is as follows,
 whether or not minus zero is supported by the implementation:
@@ -8780,7 +8757,6 @@ Examples::
       (complexp 1.2d2) ⇒  false
       (complexp #c(5/3 7.2)) ⇒  true
 
-
 See Also::
 ..........
 
@@ -9320,7 +9296,6 @@ Examples::
       (integerp 6/5) ⇒  false
       (integerp nil) ⇒  false
 
-
 Notes::
 .......
 
@@ -9442,7 +9417,6 @@ op.
 
          Figure 12-16: Bit-Wise Logical Operations
 
-
 Examples::
 ..........
 
@@ -9637,7 +9611,6 @@ no arguments are supplied.
 
        Figure 12-17: Bit-wise Logical Operations on Integers
 
-
    Negative integers are treated as if they were in two's-complement
 notation.
 
index a317136211fd91c7bb15bc4fbaba6999f76009d0..a2562cd829fcadcc0eaa3491a6ee1349afc1eff2 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -666,7 +666,6 @@ and character predicates.
 
        Figure 13-1: Character defined names - 1
 
-
    Figure 13-2 lists some character construction and conversion defined
 names.
 
@@ -676,7 +675,6 @@ names.
 
   Figure 13-2: Character defined names - 2
 
-
 \1f
 File: gcl.info,  Node: Introduction to Scripts and Repertoires,  Next: Character Attributes,  Prev: Introduction to Characters,  Up: Character Concepts
 
@@ -2235,7 +2233,6 @@ and the cdr.
 
   Figure 14-1: Some defined names relating to conses.
 
-
    Depending on context, a group of connected conses can be viewed in a
 variety of different ways.  A variety of operations is provided to
 support each of these various views.
@@ -2270,7 +2267,6 @@ some relationship among that data.
 
   Figure 14-2: Some defined names relating to trees.
 
-
 * Menu:
 
 * General Restrictions on Parameters that must be Trees::
@@ -2320,7 +2316,6 @@ some cons in the chain is the cdr of a later cons.
 
   Figure 14-3: Some defined names relating to lists.
 
-
 * Menu:
 
 * Lists as Association Lists::
@@ -2342,7 +2337,6 @@ the value associated with that key.
 
   Figure 14-4: Some defined names related to association lists.
 
-
 \1f
 File: gcl.info,  Node: Lists as Sets,  Next: General Restrictions on Parameters that must be Lists,  Prev: Lists as Association Lists,  Up: Conses as Lists
 
@@ -2358,7 +2352,6 @@ unordered and by assuming there is no duplication of elements.
 
        Figure 14-5: Some defined names related to sets.
 
-
 \1f
 File: gcl.info,  Node: General Restrictions on Parameters that must be Lists,  Prev: Lists as Sets,  Up: Conses as Lists
 
@@ -2886,7 +2879,6 @@ relationships precisely.
 
          Figure 14-6: CAR and CDR variants
 
-
    setf can also be used with any of these functions to change an
 existing component of x, but setf will not make new components.  So, for
 example, the car of a cons can be assigned with setf of car, but the car
@@ -3489,7 +3481,6 @@ list-length could be implemented as follows:
           ;;  That fact justifies this implementation.)
           (when (and (eq fast slow) (> n 0)) (return nil))))
 
-
 \1f
 File: gcl.info,  Node: listp,  Next: make-list,  Prev: list-length,  Up: Conses Dictionary
 
@@ -4104,7 +4095,6 @@ Examples::
       |>  T
      ⇒  T
 
-
 Side Effects::
 ..............
 
@@ -6092,7 +6082,6 @@ creation, access, and information operations.
 
            Figure 15-1: General Purpose Array-Related Defined Names
 
-
 * Menu:
 
 * Array Upgrading::
@@ -6157,7 +6146,6 @@ Strings::.
 
       Figure 15-2: Operators that Manipulate Strings
 
-
    Vectors whose elements are restricted to type bit are called bit
 vectors .  Bit vectors are of type bit-vector.  Figure 15-3 lists some
 defined names for operations on bit arrays.
@@ -6170,7 +6158,6 @@ defined names for operations on bit arrays.
 
   Figure 15-3: Operators that Manipulate Bit Arrays
 
-
 \1f
 File: gcl.info,  Node: Arrays Dictionary,  Prev: Array Concepts,  Up: Arrays
 
@@ -8267,7 +8254,6 @@ bit-orc1                                                   or complement of bit-
 bit-orc2                                                   or bit-array1 with complement of bit-array2
   Figure 15-3: Bit-wise Logical Operations on Bit Arrays
 
-
 Examples::
 ..........
 
@@ -9216,7 +9202,6 @@ constructed will be simple strings.
 
         Figure 17-1: Standardized Sequence Functions
 
-
 * Menu:
 
 * General Restrictions on Parameters that must be Sequences::
@@ -9266,7 +9251,6 @@ designated with either a :test or :test-not argument.
 
   Figure 17-2: Operators that have Two-Argument Tests to be Satisfied
 
-
    The object O might not be compared directly to E_i.  If a :key
 argument is provided, it is a designator for a function of one argument
 to be called with each E_i as an argument, and yielding an object Z_i to
@@ -9356,7 +9340,6 @@ basis of a one argument predicate.
 
   Figure 17-3: Operators that have One-Argument Tests to be Satisfied
 
-
    The element E_i might not be considered directly.  If a :key argument
 is provided, it is a designator for a function of one argument to be
 called with each E_i as an argument, and yielding an object Z_i to be
index 35d78ee63f7c83210b7bd15938ce1734dc8816a2..fabae7bf7d01b07f28d2a962afcd690e2170793b 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -1025,7 +1025,6 @@ The following rules apply to hash tables.
 
      Figure 18-1: Hash-table defined names
 
-
 \1f
 File: gcl.info,  Node: Modifying Hash Table Keys,  Prev: Hash-Table Operations,  Up: Hash Table Concepts
 
@@ -2083,7 +2082,6 @@ pathnames.
 
                      Figure 19-1: Pathname Operations
 
-
 \1f
 File: gcl.info,  Node: Parsing Namestrings Into Pathnames,  Prev: Pathnames as Filenames,  Up: Overview of Filenames
 
@@ -2266,7 +2264,6 @@ lists the functions relating to pathnames that permit a :case argument:
 
   Figure 19-2: Pathname functions using a :CASE argument
 
-
 \1f
 File: gcl.info,  Node: Local Case in Pathname Components,  Next: Common Case in Pathname Components,  Prev: Case in Pathname Components,  Up: Interpreting Pathname Component Values
 
@@ -2512,7 +2509,6 @@ most implementations.
 
           Figure 19-3: Special Markers In Directory Component
 
-
    The following notes apply to the previous figure:
 
 Invalid Combinations
@@ -4403,7 +4399,6 @@ directories.
 
     Figure 20-1: File and Directory Operations
 
-
 * Menu:
 
 * Coercion of Streams to Pathnames::
@@ -4448,7 +4443,6 @@ differently.
 
   Figure 20-2: File Functions that Treat Open and Closed Streams Differently
 
-
    Since treatment of open streams by the file system may vary
 considerably between implementations, however, a closed stream might be
 the most reliable kind of argument for some of these functions--in
@@ -4461,7 +4455,6 @@ that is intended to be portable should use such functions carefully.
 
   Figure 20-3: File Functions where Closed Streams Might Work Best
 
-
 \1f
 File: gcl.info,  Node: Truenames,  Prev: File Operations on Open and Closed Streams,  Up: File System Concepts
 
@@ -5142,7 +5135,6 @@ with any kind of stream.
 
   Figure 21-1: Some General-Purpose Stream Operations
 
-
    Other operations are only meaningful on certain stream types.  For
 example, read-char is only defined for character streams and read-byte
 is only defined for binary streams.
@@ -5182,7 +5174,6 @@ stream (source of data), an output stream (sink for data), both, or
 
         Figure 21-2: Operators relating to Input Streams.
 
-
    Figure 21-3 shows operators relating to output streams.
 
   clear-output   prin1            write
@@ -5194,7 +5185,6 @@ stream (source of data), an output stream (sink for data), both, or
 
   Figure 21-3: Operators relating to Output Streams.
 
-
    A stream that is both an input stream and an output stream is called
 a bidirectional stream .  See the functions input-stream-p and
 output-stream-p.
@@ -5207,7 +5197,6 @@ operators that relate specificaly to bidirectional streams.
 
   Figure 21-4: Operators relating to Bidirectional Streams.
 
-
 \1f
 File: gcl.info,  Node: Open and Closed Streams,  Next: Interactive Streams,  Prev: Input,  Up: Introduction to Streams
 
@@ -5321,7 +5310,6 @@ subclasses.
 
   Figure 21-5: Defined Names related to Specialized Streams
 
-
 \1f
 File: gcl.info,  Node: Stream Variables,  Next: Stream Arguments to Standardized Functions,  Prev: Introduction to Streams,  Up: Stream Concepts
 
@@ -5349,7 +5337,6 @@ stream.
 
   Figure 21-6: Standardized Stream Variables
 
-
    Note that, by convention, standardized stream variables have names
 ending in "-input*" if they must be input streams, ending in "-output*"
 if they must be output streams, or ending in "-io*" if they must be
@@ -5383,7 +5370,6 @@ either open or closed streams.
 
         Figure 21-7: Operators that accept either Open or Closed Streams
 
-
    The operators in Figure 21-8 accept stream arguments that must be
 open streams.
 
@@ -5408,7 +5394,6 @@ open streams.
 
              Figure 21-8: Operators that accept Open Streams only
 
-
 \1f
 File: gcl.info,  Node: Restrictions on Composite Streams,  Prev: Stream Arguments to Standardized Functions,  Up: Stream Concepts
 
@@ -8799,7 +8784,6 @@ control variables.
 
        Figure 22-1: Standardized Printer Control Variables
 
-
    In addition to the printer control variables, the following
 additional defined names relate to or affect the behavior of the Lisp
 printer:
@@ -8809,7 +8793,6 @@ printer:
 
    Figure 22-2: Additional Influences on the Lisp printer.
 
-
 \1f
 File: gcl.info,  Node: Printer Escaping,  Prev: Multiple Possible Textual Representations,  Up: Overview of The Lisp Printer
 
index 74d97ac9545e25dc6b0013f116be272b2ab10044..538bad3674a477d8b9f50c6ddfc76c11cc2aeee6 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -501,7 +501,6 @@ pretty printing.
 
              Figure 22-3: Defined names related to pretty printing.
 
-
    Figure 22-4 identifies a set of format directives which serve as an
 alternate interface to the same pretty printing operations in a more
 textually compact form.
@@ -511,7 +510,6 @@ textually compact form.
 
   Figure 22-4: Format directives related to Pretty Printing
 
-
 \1f
 File: gcl.info,  Node: Compiling Format Strings,  Next: Pretty Print Dispatch Tables,  Prev: Format Directive Interface,  Up: Pretty Printer Concepts
 
@@ -934,7 +932,6 @@ call.
 
              Figure 22-5: Examples of format control strings
 
-
    format sends the output to destination.  If destination is nil,
 format creates and returns a string containing the output from
 control-string.  If destination is non-nil, it must be a string with a
@@ -3503,7 +3500,6 @@ the Lisp printer.
 
   Figure 22-6: Argument correspondences for the WRITE function.
 
-
    prin1, princ, print, and pprint implicitly bind certain print
 parameters to particular values.  The remaining parameter values are
 taken from *print-array*, *print-base*, *print-case*, *print-circle*,
@@ -5105,7 +5101,7 @@ to prevent it from being a constituent.  If the line
 a}.  This could be corrected by putting a space before the }, but it is
 better to call set-macro-character.
 
-   Giving } the same   definition as the standard definition of the
+   Giving } the same definition as the standard definition of the
 character ) has the twin benefit of making it terminate tokens for use
 with read-delimited-list and also making it invalid for use in any other
 context.  Attempting to read a stray } will signal an error.
@@ -5604,7 +5600,6 @@ mentioned here, too.]
 
          Figure 23-1: Values of standard control variables
 
-
 Examples::
 ..........
 
@@ -5812,7 +5807,7 @@ Dispatching macro characters (including sharpsign)
 continue to delimit and construct lists; the #( notation continues to
 delimit vectors; and comments, strings, and the single-quote and
 backquote notations continue to be interpreted properly.  Such
-situations as '),      #<, #), and #<Space> continue to signal errors.
+situations as '), #<, #), and #<Space> continue to signal errors.
 
 Examples::
 ..........
@@ -6039,7 +6034,6 @@ expressions, and how they would be read_2 in these implementations.
 
               Figure 24-1: Features examples
 
-
 \1f
 File: gcl.info,  Node: System Construction Dictionary,  Prev: System Construction Concepts,  Up: System Construction
 
@@ -6944,7 +6938,6 @@ variables that are maintained by the Lisp read-eval-print loop.
 
   Figure 25-1: Variables maintained by the Read-Eval-Print Loop
 
-
 \1f
 File: gcl.info,  Node: Debugging Utilities,  Next: Environment Inquiry,  Prev: Top level loop,  Up: The External Environment
 
@@ -6961,7 +6954,6 @@ Figure 25-2 shows defined names relating to debugging.
 
   Figure 25-2: Defined names relating to debugging
 
-
 \1f
 File: gcl.info,  Node: Environment Inquiry,  Next: Time,  Prev: Debugging Utilities,  Up: The External Environment
 
@@ -6981,7 +6973,6 @@ executed.
 
     Figure 25-3: Defined names relating to environment inquiry.
 
-
 \1f
 File: gcl.info,  Node: Time,  Prev: Environment Inquiry,  Up: The External Environment
 
@@ -7009,7 +7000,6 @@ represented as a non-negative real number of seconds.
 
         Figure 25-4: Defined names involving Time.
 
-
 * Menu:
 
 * Decoded Time::
@@ -7069,7 +7059,6 @@ Time zone
 
   Figure 25-5: Defined names involving time in Decoded Time.
 
-
 \1f
 File: gcl.info,  Node: Universal Time,  Next: Internal Time,  Prev: Decoded Time,  Up: Time
 
@@ -7094,7 +7083,6 @@ Lisp.
 
   Figure 25-6: Defined names involving time in Universal Time.
 
-
 \1f
 File: gcl.info,  Node: Internal Time,  Next: Seconds,  Prev: Universal Time,  Up: Time
 
@@ -7113,7 +7101,6 @@ to an arbitrary time base.
 
   Figure 25-7: Defined names involving time in Internal Time.
 
-
 \1f
 File: gcl.info,  Node: Seconds,  Prev: Internal Time,  Up: Time
 
@@ -7131,7 +7118,6 @@ fractional seconds.
 
   Figure 25-8: Defined names involving time in Seconds.
 
-
 \1f
 File: gcl.info,  Node: Environment Dictionary,  Prev: The External Environment,  Up: Environment
 
@@ -8843,3 +8829,13 @@ Affected By::
 
 The host computer's file system, and the implementation.
 
+\1f
+File: gcl.info,  Node: Glossary (Glossary),  Next: Appendix,  Prev: Environment,  Up: Top
+
+26 Glossary
+***********
+
+* Menu:
+
+* Glossary::
+
index e2e5bd5ea73ba1b5b59bf048540f0cb2b840fb49..0a079187ec23b3deb1444db955b7672339237bd2 100644 (file)
@@ -1,4 +1,4 @@
-This is gcl.info, produced by makeinfo version 7.1 from gcl.texi.
+This is gcl.info, produced by makeinfo version 7.3 from gcl.texi.
 
 This is a Texinfo GNU Common Lisp Manual based on the draft ANSI
 standard for Common Lisp.
@@ -10,16 +10,6 @@ START-INFO-DIR-ENTRY
 * gcl: (gcl.info). GNU Common Lisp Manual
 END-INFO-DIR-ENTRY
 
-\1f
-File: gcl.info,  Node: Glossary (Glossary),  Next: Appendix,  Prev: Environment,  Up: Top
-
-26 Glossary
-***********
-
-* Menu:
-
-* Glossary::
-
 \1f
 File: gcl.info,  Node: Glossary,  Prev: Glossary (Glossary),  Up: Glossary (Glossary)
 
@@ -1423,7 +1413,6 @@ exponent marker
 
                 Figure 26-1: Exponent Markers
 
-
 export
      v.t.  (a symbol in a package) to add the symbol to the list of
      external symbols of the package.
@@ -1886,7 +1875,6 @@ I/O customization variable
 
        Figure 26-2: Standardized I/O Customization Variables
 
-
 identical
      adj.  the same under eq.
 
@@ -2080,7 +2068,6 @@ iteration form
 
          Figure 26-3: Standardized Iteration Forms
 
-
 iteration variable
      n.  a variable V, the binding for which was created by an explicit
      use of V in an iteration form.
@@ -3108,7 +3095,6 @@ restart function
 
        Figure 26-4: Standardized Restart Functions
 
-
 return
      v.t.  (of values) 1.  (from a block) to transfer control and values
      from the block; that is, to cause the block to yield the values
@@ -3736,7 +3722,7 @@ time zone
      (inclusive) that represents a time zone as a number of hours offset
      from Greenwich Mean Time.  Time zone values increase with motion to
      the west, so Massachusetts, U.S.A. is in time zone 5, California,
-     U.S.A. is time zone 8, and Moscow, Russia is time zone -3.  (When
+     U.S.A.  is time zone 8, and Moscow, Russia is time zone -3.  (When
      "daylight savings time" is separately represented as an argument or
      return value, the time zone that accompanies it does not depend on
      whether daylight savings time is in effect.)
index 86c206713677a2a71010489bf2b9f884ff91b935..83ccb02c7798349bce787e1186e9f56f9904b43f 100644 (file)
@@ -120,7 +120,7 @@ will bear a name based on the name of the file, so that it may be invoked
 by name by C code.
 @end vtable
 
-@node Operating System Definitions,  , Command Line, Operating System
+@node Operating System Definitions, Environment Variables , Command Line, Operating System
 @section Operating System Definitions
 
 @defun GET-DECODED-TIME ()